Oh no!

Template knot disallowed for unauthenticated users.

baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/NAND Is Enough

One gate is enough to build all the others: NAND (NOT(a AND b)), Sheffer 1913.

NOT a = a NAND a

a 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.

0 Axones