A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
NAND and NOR gates are universal because any boolean function can be constructed using only NAND gates (or only NOR gates). This property makes them essential for minimizing component types in digital circuits.
Design AND, OR, and NOT using only NAND gates; repeat with NOR. Observe how the same gate type replaces different gate families.
Not all gates are equally universal—AND and OR alone cannot implement NOT. The order matters when stacking universal gates.
From Boolean algebra, you know that any logical expression can be written using AND, OR, and NOT. These three operations are functionally complete — together they can express any truth table. But here is a remarkable fact: you can throw away two of those three gate types and still build everything, as long as the one gate you keep is either NAND or NOR. These are called universal gates because each one alone is sufficient to implement any Boolean function.
Start with NAND, which outputs 0 only when both inputs are 1 (it is AND followed by NOT). To build a NOT gate, connect the same signal to both inputs of a NAND: NAND(A, A) = NOT(A), because when A is 1, both inputs are 1, so the output is 0, and when A is 0, at least one input is 0, so the output is 1. To build an AND gate, take the output of a NAND and feed it through your NAND-built NOT — you are negating the negation, recovering the original AND. To build an OR gate, apply De Morgan's theorem: A OR B = NOT(NOT(A) AND NOT(B)), which is a NAND of two inverted inputs. Since you already know how to build NOT from NAND, you can build OR. With AND, OR, and NOT all implemented, you can build any Boolean function using nothing but NAND gates.
The same argument works for NOR (which outputs 1 only when both inputs are 0). NOR(A, A) gives NOT(A). Two NOTs followed by a NOR gives AND. A NOR followed by a NOT gives OR. The constructions are symmetric to the NAND case, following from the other form of De Morgan's theorem.
Why does this matter in practice? Manufacturing simplicity. If a chip fabrication process can produce one gate type reliably, it can produce entire processors. Early integrated circuits were built entirely from NAND gates (TTL 7400 series) because NAND is slightly faster and cheaper to fabricate in common transistor technologies. Rather than designing and testing three or four different gate structures, engineers design one and compose everything from it. This is why NAND-only or NOR-only implementations appear throughout real hardware — they are not just a theoretical curiosity but a practical manufacturing strategy. Understanding universality also deepens your grasp of Boolean algebra: it proves that the AND/OR/NOT decomposition, while intuitive, is not the only way — or even the most efficient way — to think about logic.