|
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. : 12:05 pm]  Oh_Man -- bah this is fcked - it's like they've disallowed using image through text thing - can only have image or text - not both?[2014-9-06. : 12:01 pm] Oh_Man -- the hyperlink works, but not the image, I even tried replacing [img] with [img= still doesnt wrk[2014-9-06. : 11:38 am]  Roy -- Or were you talking about BBCode? [url=HyperlinkGoesHere][img]ImageGoesHere[/img][/url][2014-9-06. : 11:32 am] Oh_Man -- can someone plz tell me what the code is now to make a image that is also a hyperlink???[2014-9-06. : 11:24 am] Roy -- JackJack shouted: transistors which are 1, 0, and both 1 and 0 Like nullable booleans.[2014-9-06. : 10:43 am] Oh_Man -- bit harsh that they install this policy and give users less than 2 weeks to back their shit up - now i've lost it all[2014-9-06. : 10:35 am] Oh_Man -- oh no... i think twitch has deleted all my videos due to their VOD policy  [2014-9-06. : 9:07 am]  O)FaRTy1billion[MM] -- ... I think they are commutative, because in my program I had a xor d, but changed it to d xor a to get b, but I'll play with that tomorrow. This is so much fun for no real end  [2014-9-06. : 9:00 am] O)FaRTy1billion[MM] -- Anyway, I'm done flooding the shoutbox with useless nonsense. Goodnight![2014-9-06. : 8:59 am] O)FaRTy1billion[MM] -- c xor a = not(c xor b) ... So it's a bit more complicated than binary xor, but it shares similar (but extended) properties. [2014-9-06. : 8:57 am] O)FaRTy1billion[MM] -- (a)111000TTT xor (b)10T10T10T = (c)T1010T0T1; (c)T1010T0T1 xor (a)111000TTT = (d)0T110TT10; (c)T1010T0T1 xor (d)0T110TT10 = (b)10T10T10T[2014-9-06. : 8:56 am] O)FaRTy1billion[MM] -- Oh, it's ternary, so you need three operations to do that .. which my xor works fine for.  a xor b = c; c xor a = d; c xor d = b.[2014-9-06. : 8:46 am] O)FaRTy1billion[MM] -- right now as it is, a xor b = c, and c xor a = not(c xor b) ;o[2014-9-06. : 8:44 am] O)FaRTy1billion[MM] -- I should try to make one that fits a xor b = c, a xor c = b, b xor c = a ;o I don't know if it's possible though[2014-9-06. : 8:40 am] O)FaRTy1billion[MM] -- xor is based on "T+T=T1; T+0= T; T+1= 0; 0+T= T; 0+0= 0; 0+1= 1; 1+T= 0; 1+0= 1; 1+1=1T", much like in binary it is "1+1=10; 1+0=1; 0+1=1; 0+0=0"[2014-9-06. : 8:38 am] O)FaRTy1billion[MM] -- 1 = true, 0 = unknown, T = false. 'XORB' is basically just binary xor but any 0s return 0[2014-9-06. : 8:37 am] O)FaRTy1billion[MM] -- 111000TTT AND 10T10T10T -> 10T00TTTT; 111000TTT OR 10T10T10T -> 11110010T; 111000TTT XOR 10T10T10T -> T1010T0T1; 111000TTT XORB 10T10T10T -> T0100010T[2014-9-06. : 8:36 am] O)FaRTy1billion[MM] -- I don't know if I should call it xor, but {true, true, false, false} xor {true, false, true, false} = {false, unknown, unknown, true} ... so I made a XORB (for binary) that will return {false, true, true, false} ;o[2014-9-06. : 8:21 am] O)FaRTy1billion[MM] -- Ooooh. I did do it wrong ... I was thinking in non-negative-digit-values 1+1=-1, so my XOR definition is wrong[2014-9-06. : 8:17 am] O)FaRTy1billion[MM] -- My definition of XOR doesn't work like that D: 11TT XOR 1T1T -> 0000 ... should I redefine it so it's T11T as in binary?[2014-9-06. : 8:15 am] O)FaRTy1billion[MM] -- basically like 1100 AND 1010 -> 1000; 1100 OR 1010 -> 1110; 1100 XOR 1010 -> 0110. [2014-9-06. : 8:14 am] O)FaRTy1billion[MM] -- 111000TTT AND 10T10T10T -> 10T00TTTT; 111000TTT OR 10T10T10T -> 11110010T; 111000TTT XOR 10T10T10T -> 01010T0T0[2014-9-06. : 8:13 am] O)FaRTy1billion[MM] -- I like callback functions. xD I made the functions like "char tritOP(char a, char b)", but instead of making a bunch of functions for doing each op on a string I made bitwise(char* a, char* b, char (*func)(char a, char b)) xD[2014-9-06. : 8:01 am] O)FaRTy1billion[MM] -- Oh no, I opted to put them in reading-order instead of lsb-first, so bitwise operations are going to be tricky for ones not of the same length D:[2014-9-06. : 7:58 am] O)FaRTy1billion[MM] -- Hooray, simplified my negate() function by just making it call tritNOT for evey digit [2014-9-06. : 7:56 am] O)FaRTy1billion[MM] -- people like to use + for 1 and - for -1, except that has the problem of those are already math operations :\[2014-9-06. : 7:54 am] O)FaRTy1billion[MM] -- I think there's 6 trits in a tryte, but I don't remember [2014-9-06. : 7:53 am] O)FaRTy1billion[MM] -- I could store them as binary-encoded-ternary .. where the binary strings 11 = -1, 01 = 1, 00 = 0, and 10 = undefined [2014-9-06. : 7:51 am] O)FaRTy1billion[MM] -- I store them as a string with possible values of '0', '1', or 'T'[2014-9-06. : 7:51 am] O)FaRTy1billion[MM] -- But to use a table like that I'd have to store them as 0, 1, 2 or do weird table pointers[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. |
Members Online: NimoStar