Figure 5: A reversible set of primitives in terms of which any Boolean function f(x) can be computed with roughly the same number of gates as with classical NANDs and NORs.