philosophy
U(IS NOT, IS NOT)
You can compute anything at all using the negation of an AND gate (NAND) or an OR gate (NOR). I find that very interesting. You can apply either of these simple rules recursively to compute anything: * NAND: the result is 0 if both inputs are 1, otherwise it's