|
Members in Shoutbox
None.
Shoutbox Search
Shoutbox Commands
/w [name] > Whisper
/r > Reply to last whisper /me > Marks as action Shoutbox Information
Moderators may delete any and all shouts at will.
|
Global Shoutbox
Please log in to shout.
[2014-9-06. : 7:49 am]  jjf28 -- table[(int)'T'][(int)'T']; /** Fill in relevant values */ return table[a][b]; skips over the character conversions  [2014-9-06. : 7:49 am]  O)FaRTy1billion[MM] -- LUTs are cheap solutions, especially when each one of these is two 'if's, else '0'.  [2014-9-06. : 7:49 am] O)FaRTy1billion[MM] -- char tritXOR(char a, char b){ if(a == '0') return b; if(b == '0') return a; return '0'; } Easier than I thought [2014-9-06. : 7:45 am] O)FaRTy1billion[MM] -- char tritNOT(char a){ if(a == '1') return 'T'; if(a == 'T') return '1'; return '0'; } char tritAND(char a, char b){ if(a == '1' && b == '1') return '1'; if(a == 'T' || b == 'T') return 'T'; return '0'; } char tritOR(char a, char b){ if(a == '1' || b == '1') return '1'; if(a == 'T' && b == 'T') return 'T'; return '0'; } Those ones are easy[2014-9-06. : 7:45 am] O)FaRTy1billion[MM] -- I don't know how to simply code this trinary logic operation  p[2014-9-06. : 7:44 am] O)FaRTy1billion[MM] -- Also binary only has XOR, OR, AND and NOT as fundamental gates. stuff like NAND and NOR can be expressed as combinations[2014-9-06. : 7:43 am] jjf28 -- to many logic gates in just binary, however would i keep track in ternary [2014-9-06. : 7:43 am] O)FaRTy1billion[MM] -- I think NAND is the fastest or something, because I remember in my digital electronics class NAND is what we had to use all the time[2014-9-06. : 7:34 am] O)FaRTy1billion[MM] -- so -1+-1=0 (carried), -1+0=-1, -1+1=0, 0+-1=-1, 0+0=0, 0+1=1, 1+-1=0, 1+0=1, 1+1=0 (carried)[2014-9-06. : 7:32 am] O)FaRTy1billion[MM] -- I could make an 'xor' analog based on xor for binary being addition ... 1+1=0 (carried), 1+0=1, 0+1=1, 0+0=0[2014-9-06. : 7:29 am] O)FaRTy1billion[MM] -- so if A = TRUE, A OR (true/false) is necessarily true. If A = FALSE, A AND (true/false) is necessarily false[2014-9-06. : 7:28 am] O)FaRTy1billion[MM] -- This explains it as basically 0 is schrodinger's boolean value... It's both true and false [2014-9-06. : 7:28 am] jjf28 -- xors a building block of binary computers (cause it's the fastest logic gate), but I don't see much use for it outside of that[2014-9-06. : 7:26 am] O)FaRTy1billion[MM] -- basically if A or B is false then A AND B = false, else if A or B is 0 then A AND B = 0, else A and B are true then A AND B = true.[2014-9-06. : 7:24 am] O)FaRTy1billion[MM] -- http://en.wikipedia.org/wiki/Three-valued_logic Woo, there's already logic tables on it [2014-9-06. : 7:23 am] O)FaRTy1billion[MM] -- I think there have been ternary machines, I'm just not sure how they work [2014-9-06. : 7:23 am] O)FaRTy1billion[MM] -- I think not 0 = 0. Because when you negate the number you just make 1s into Ts and Ts into 1s.[2014-9-06. : 7:22 am] jjf28 -- whatever uses the least transistor stages and makes the most efficient math come out[2014-9-06. : 7:20 am] O)FaRTy1billion[MM] -- Bitwise logic tables would have to be adjusted ... If 1 is true and -1 is false, what would 1 & 0 or -1 & 0 be?[2014-9-06. : 7:20 am] O)FaRTy1billion[MM] -- and it's cool because to negate you just swap all 1s with Ts, and vice-versa[2014-9-06. : 7:19 am] O)FaRTy1billion[MM] -- It's also cool because there is no sign ... A negative number just starts with 'T'.[2014-9-06. : 7:18 am] O)FaRTy1billion[MM] -- the wikipedia page for it describes addition, subtraction, multiplication, division, and I think like powers or something .. but I didn't read those[2014-9-06. : 7:17 am] O)FaRTy1billion[MM] -- But it's cool because instead of just 'true' or 'false', there is an indeterminate state.[2014-9-06. : 7:16 am] O)FaRTy1billion[MM] -- It's actually really simple, it's just hard to figure it out[2014-9-06. : 7:15 am] O)FaRTy1billion[MM] -- it's not binary, so instead of 2x for place values it's 3x[2014-9-06. : 7:14 am] jjf28 -- so you just multiply by the binary place value, then add (or subract when they're T's) the digits together?[2014-9-06. : 7:12 am] O)FaRTy1billion[MM] -- Oh, I finished adding unit stacking to the sectionstacker program [2014-9-06. : 7:11 am] O)FaRTy1billion[MM] -- It's ternary, but instead of digit values of 0, 1, and 2 it has -1, 0, and 1[2014-9-06. : 7:11 am] jjf28 -- yeah but I don't know that one, so I don't know how to suggest things for it[2014-9-06. : 7:10 am] O)FaRTy1billion[MM] -- I can convert to and from this number system, but what do I do with it? [2014-9-06. : 6:45 am] O)FaRTy1billion[MM] -- but the cat licks her asshole, I don't want that in my drink D:[2014-9-06. : 6:32 am] O)FaRTy1billion[MM] -- Oh, I already shouted 11T011T1. 1TTTT1 is a different number.[2014-9-06. : 6:25 am] O)FaRTy1billion[MM] -- aaa kitty, y u sticking your face in my cup of milk? :C[2014-9-06. : 4:30 am] Centreri -- Someone should make one of those see-the-planets-size-and-distance-relative-to-each-other diagrams with log distances. That would be fun. |
Members Online: 
l)ark_ssj9kevin, Ultraviolet
l)ark_ssj9kevin, Ultraviolet