One Gate
one gate. build everything from it.
a game in six levels on a pixel circuit board: one gate, NAND, lit unless both switches are on, becomes not, and, or, xor and an adder that says 1 + 1 = 10, each built from the chips you made before
Everything a computer does can be built from one small gate. NAND (not-and) is lit unless both of its inputs are on, and it is functionally complete: NOT, AND, OR and every other logic function can be wired from NANDs alone. Charles Sanders Peirce found this about 1880 but never published it; Henry Sheffer published the stroke in 1913 (Transactions of the American Mathematical Society 14, 481-488), and Jean Nicod in 1917 used it for not-and, the sense it kept. The builds here are the classic ones: NOT is one NAND with its inputs tied, AND is a NAND and a NOT, OR is a NAND of two NOTs, XOR takes four NANDs, and a half adder (the sum and the carry of two bits) takes five at the fewest. The same idea flew to the Moon with another one-gate family: the Apollo Guidance Computer's logic was made of three-input NOR gates, about 5,600 of them in the Block II flights (about 2,800 dual-gate chips). The board is a toy: real gates have delays, power and limits on how many inputs one output can drive, and none of that is drawn. Each level is checked by the card's own test bench, which runs every switch combination; your fewest gates are your own, kept on this device and account, and ranked against nobody. The level-by-level build-up is a classic of computing courses; this board and its chips are our own design.
Concepts: logic, computing.
A small game to play, on Wundr, made by @neelu.
On the shelf numbers & logic, and also on shape.