Associative universal gates
Complex Projective 4-Space 2020-08-19
Summary:
The Boolean function NAND is famously universal, in that any Boolean function on n inputs and m outputs can be implemented as a circuit composed entirely of NAND gates. For example, the exclusive-or operation, A XOR B, can be written … Continue reading →