O)FaRTy1billion[MM] -- I guess in binary since every logic gate can be built with NAND I don't really need to try and define all 122 tables .. I just need to prove that they can reasonably be produced with the ones I have defined
O)FaRTy1billion[MM] -- inc and dec because they are the result of incrementing/decrementing the value ... 1+1 = 1T (or T), T+1=0, 0+1=1; T-T=T1 (or 1), 0-1=T, 1-1=0.
O)FaRTy1billion[MM] -- not swaps T and 1, 'not inc' swaps 0 and T, 'not dec' swaps 0 and 1 ... I don't know what else to call them (before I did 'up' and 'down').
O)FaRTy1billion[MM] -- (with T being -1) not 10T = T01; inc 10T = T10; dec 10T = 0T1 is what 'inc' and 'dec' are ...
O)FaRTy1billion[MM] -- xor's the coolest in this still. a xor a = not a; a xor not a = 0; a xor 'inc' a = not 'dec' a; a xor 'dec' a = not 'inc' a; a xor not 'inc' a = -1; a xor not 'dec' a = 1
O)FaRTy1billion[MM] -- Now I need to figure out how to narrow down that 122 in to useful ones ...