|
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-07. : 1:10 am]  O)FaRTy1billion[MM] -- I'm bored of operations, what can I do with this?  Can I like encode data in trinary?[2014-9-07. : 1:07 am] O)FaRTy1billion[MM] -- nup and ndown work like 'not', where 'not' swaps 1 and T, 'nup' swaps 0 and T, and 'ndown' swaps 0 and 1.[2014-9-07. : 1:02 am] O)FaRTy1billion[MM] -- 'up' is basically a+1, and 'down' is basically a-1. I didn't know what else to call them.[2014-9-07. : 1:01 am] O)FaRTy1billion[MM] -- yay, narrowed down to 5 basic single-operator instructions ... not, up, down, not-up, and not-down ... which can be narrowed down to the 3 that I originally said  [2014-9-06. : 11:52 pm]  Jack -- The hardest times for me are about a week in, and about 30 days in. Other than that it's usually pretty easy[2014-9-06. : 11:50 pm] Jack -- paynepayne shouted: Jack how many days you guys lasted? like 5? ye probably one of my worst efforts [2014-9-06. : 11:42 pm] BloodyZombie117 -- Okay. Going to do absolutely nothing until then. Be back soon.[2014-9-06. : 11:29 pm]  payne -- JackJack shouted: day1 3ez 5me how many days you guys lasted? like 5? [2014-9-06. : 9:22 pm] O)FaRTy1billion[MM] -- We got a bunch of breadboards and NAND chips and had to do stuff with them[2014-9-06. : 8:45 pm] Jack -- Use the logic simulator program there, lots of fun. You can build a functioning CPU with it![2014-9-06. : 8:44 pm] Jack -- Farty, check this outhttp://cs-alb-pc3.massey.ac.nz/notes/59233/index.html[2014-9-06. : 7:49 pm] O)FaRTy1billion[MM] -- except there are ways to greatly reduce that number if you consider basic secondary operations as equivalent ... like saying NAND is equivalent to AND.[2014-9-06. : 7:48 pm] O)FaRTy1billion[MM] -- Order doesn't matter, I said A ? B == B ? A where ? is whichever operator[2014-9-06. : 7:42 pm] jjf28 -- FaRTy1billionFaRTy1billion shouted: aaa, making an exhaustive list of possible binary gates, there are 8 (excluding ones where A ? B and B ? A would have different results)... for ternary there are 729. I don't want to list all of these :C i count 19683 o.O[2014-9-06. : 7:31 pm] O)FaRTy1billion[MM] -- That could complete my set of single-input operators .. Binary only has a max of two: identity (a -> b) and not (!a -> b), and the first doesn't really count.  [2014-9-06. : 7:29 pm] O)FaRTy1billion[MM] -- I could add rotate operators, where -1 -> 0, 0 -> 1, 1 -> -1...and ignore ones that are also rotations. [2014-9-06. : 7:26 pm] O)FaRTy1billion[MM] -- I should make a program to list these without any stupid ones where A ? B = a value, and to skip any that are negations of others... but there'd still be a ton. If it's the same as binary then there will still be 363 ( (36-3)/2; -3 for the ones where result is always -1, 0 or 1, and divided by 2 because half will presumably be negates of the other half ).[2014-9-06. : 7:21 pm] O)FaRTy1billion[MM] -- jjf28jjf28 shouted: whats the point of having a gate for that I said it was an exhaustive list. [2014-9-06. : 7:20 pm] O)FaRTy1billion[MM] -- Er, not two .. half of them are negations of the others |
Members Online: MobMob, IskatuMesk
IskatuMesk