Universal Gates

A universal gate can build any Boolean function on its own; NAND and NOR each have this property.

What universal means

A set of gates is functionally complete if every possible Boolean function can be built from it. Remarkably, a single gate type can be complete on its own. Both NAND and NOR are universal in this sense.

Why NAND and NOR qualify

Kronos motion — classical

A set is complete if it can produce NOT, AND, and OR, because those three suffice for any function. NAND and NOR can each produce all three, so each alone is enough. AND, OR, and XOR by themselves are not universal because none of them can invert.

NAND construction

NOT A = NAND(A, A).
A AND B = NOT(NAND(A, B)), a NAND feeding a NAND inverter.
A OR B = NAND(NOT A, NOT B), using two inverters then a NAND.

NOR construction

NOT A = NOR(A, A).
A OR B = NOT(NOR(A, B)).
A AND B = NOR(NOT A, NOT B).

Why designers care

Building an entire library from one primitive simplifies fabrication, characterization, and verification. A process optimized for a fast, compact NAND can implement any logic by composition, which is one reason NAND-heavy design is common in real silicon.

A caution

Universality is about logical completeness, not efficiency. A function built purely from NAND may use more gates or stages than a mixed implementation. Designers exploit universality for regularity while still minimizing with algebra and Karnaugh maps.