Kastalia Knowledge Management System · Glasperlenspiel template · knot 4385

NAND Is Enough

🌐 public · created AE561117 (17.11.2026) · by daniel-hromada · open in the standard editor view · 📽 open as presentation

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.

Ancestors (1 superordinated path)