This is a pretty cool demonstration, but it should go without saying that all computers are built, fundamentally, to be "functionally complete." (http://www.cs.

This is a pretty cool demonstration, but it should go without saying that all computers are built, fundamentally, to be "functionally complete." (http://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Comb/comp.html http://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Comb/comp....) The NAND and NOR functions, independently, are the most well-known functionally complete sets -- that is, all Boolean logic can be derived from each of those single Boolean functions.