All Boolean functions are polynomials

from blog Technical Journal, | ↗ original
…in the integers mod 2 (a.k.a. the finite field of order 2). Multiplication mod 2 is AND: A B (AB) A B AND 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 Adding one mod 2 is NOT: A (A+1) A NOT 0 1 1 1 0 0 So, multiplication plus one is NAND: A B (AB+1) A B NAND 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 0 Since NAND is universal, and any finite composition of polynomials...