Functional Completeness

The gates $NOT$ï»¿ and any one from $\{AND, OR\}$ï»¿ are functionally complete. In other words, we can use these to represent any boolean function $f: (\{0, 1\}^n) \to \{0, 1\}$ï»¿.

Thus, they for a universal set of gates.

Circuits

Functional Completeness

The gates $NOT$ï»¿ and any one from $\{AND, OR\}$ï»¿ are functionally complete. In other words, we can use these to represent any boolean function $f: (\{0, 1\}^n) \to \{0, 1\}$ï»¿.

Thus, they for a universal set of gates.