NAND Is Enough
17.11.2026 · AE561117
One gate is enough to build all the others: NAND (NOT(a AND b)), Sheffer 1913.NOT a = a NAND aa AND b = NOT (a NAND b) — i.e. a NAND followed by a NAND with itself.a OR b = (NOT a) NAND (NOT b) — De Morgan at work.A NAND gate in a chip costs four transistors. Billions of them, wired by algebra, are every computer you know.
> click / swipe / arrow keys to begin_