This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
user:nsano:portfolio:trinaryresearch [2012/05/09 11:30] – [Not Logic proposal] nsano | user:nsano:portfolio:trinaryresearch [2014/09/23 17:49] (current) – [Ternary logical not gate] Nsano | ||
---|---|---|---|
Line 1: | Line 1: | ||
+ | =====Ternary after thought research===== | ||
+ | This is a Concept i been messing with in my free time for about 3 semesters and is the idea of what i think ternary logic might boil down to when given three variables as if u would as an example 0,1 is binary but what if ternary used something like A,B,C or 0,1,2 (all combinations of three things would work for ease of understanding and readability i will be using A,B,C) | ||
+ | |||
+ | ====== Research ====== | ||
+ | |||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | * [[http:// | ||
+ | |||
+ | |||
+ | ====== Ternary logical not gate ====== | ||
+ | |||
+ | Ternary logic gates | ||
+ | |||
+ | possible ternary inputs and out puts | ||
+ | A | ||
+ | B | ||
+ | C | ||
+ | |||
+ | Part 0x0 | ||
+ | |||
+ | The idea I am working on is not one output for every input, | ||
+ | but two outputs for every input | ||
+ | |||
+ | Example 0x0 | ||
+ | /-B | ||
+ | (A)-* | ||
+ | \-C | ||
+ | |||
+ | Part 0x1 | ||
+ | |||
+ | However with this method the multiple combinations are near | ||
+ | endless and must be ordered and managed which i have come up with | ||
+ | a ordered set in ordered to understand what to do. | ||
+ | |||
+ | Example 0x1 | ||
+ | /-B(first to be processed) | ||
+ | (A)A-* | ||
+ | \-C(second to be processed) | ||
+ | (B):C is to be processed first B second | ||
+ | (C):both B and C are waiting for the third input | ||
+ | |||
+ | Which would indicate a second A which would tell the system to process | ||
+ | the B or first order in order of possible inputs/ | ||
+ | |||
+ | Part 0x2 | ||
+ | |||
+ | Now we are posed with another problem how to indicate if you want to use | ||
+ | the second output at all how to indicate that is such | ||
+ | |||
+ | Example 0x2 | ||
+ | / | ||
+ | (A)AA-* | ||
+ | | ||
+ | (B):C is to be processed entirely including potential outcomes of processand B is to be droped | ||
+ | (C): | ||
+ | to process Bs frist three outputs then Cs frist three outputs then back to B | ||
+ | |||
+ | so in essance a data stream will look like 3 sets of 3 inputs to get one or | ||
+ | Two 1 set of 3 out put | ||
+ | | ||
+ | part 0x3 | ||
+ | |||
+ | Which brings me to name a set of 3 inputs is to be a Tryte and a single input to be | ||
+ | called a Tithe | ||
+ | |||
+ | Possible single Tryte | ||
+ | ---------------------------------------------------------------------------- | ||
+ | AAA|BBB|CCC\\ | ||
+ | AAB|BBA|CCA\\ | ||
+ | AAC|BBC|CCB\\ | ||
+ | ABA|BAB|CAC\\ | ||
+ | ACA|BCB|CAB\\ | ||
+ | ABB|BAA|CBA\\ | ||
+ | ABC|BAC|CBC\\ | ||
+ | ACA|BCC|CAA\\ | ||
+ | ACB|BCA|CBB\\ | ||
+ | ACC| | | ||
+ | |||
+ | Some may be missing | ||
+ | |||
+ | part 1x0 | ||
+ | |||
+ | A new concept nearly 2 years later how would a system denote a binary versus a trinary program execution and how it would run | ||
+ | |||
+ | the simplest idea is the file extension once its been written such as exe for a windows executable | ||
+ | the ternary system would see exe and say binary where say it would see tex such as tinary executable and would say execute as a ternary program | ||
+ | |||
+ | : | ||
+ | |||
+ | example 1x0 | ||
+ | |||
+ | steam.exe versus steam.tex | ||
+ | |||
+ | steam.exe will have a Ternary notation in how to process which would be a A followed by the next two bits represented by B or C for simplicity if a double A is found it will denote end of command or input and a will be follow by a extension either A B or C telling what it will pull next | ||
+ | |||
+ | steam.tex will run as stated above with one input and one or 2 outputs depending on the sequence of the input | ||
+ | |||
+ | part 1x1 | ||
+ | |||
+ | binary ternary comparison\\ | ||
+ | |||
+ | given an exe will denote a binary executable\\ | ||
+ | |||
+ | A will begin each set of 2 bits and will run 5 tryte at a time to get a full byte this will continue to run untill it denotes a double AA at the beginning of a tryte and the 3rd trinary integer will denote pull next, stop, or repeat as in A pull next, B stop, or C repeat previous input process.\\ | ||
+ | |||
+ | 1x1 example\\ | ||
+ | |||
+ | for this example let B = 1 and C = 0\\ | ||
+ | |||
+ | ABC in binary running in ternary would display 10\\ | ||
+ | ACB in binary running in ternary would display 01\\ | ||
+ | ABB in binary running in ternary would display 11\\ | ||
+ | ACC in binary running in ternary would display 00\\ | ||
+ | |||
+ | so take the previous 4 Trytes and display binary in sqeuence with a AA followed by a B in 5th tryte\\ (thrid Ternary integer is a B denoting stop) so if we pull a\\ | ||
+ | ABCACBABBACCAAB : 10011100 \\ | ||
+ | in binary and to spread it out to make it more readable we would see\\ | ||
+ | ABC ACB ABB ACC AAB : 10 01 11 00\\ | ||
+ | if we break it down farther we would get\\ | ||
+ | ABC : 10\\ | ||
+ | ACB : 01\\ | ||
+ | ABB : 11\\ | ||
+ | ACC : 00\\ | ||
+ | AAB : AA denotes end of byte B declares stop\\ | ||
+ | |||
+ | continuing this process we follow the ABCACBABBACC with not a AAB but a AAA and we would pull the next since the 3rd ternary integer is A meaning pull next 5 trytes and process | ||
+ | so we pull an additional ABCACBABBACCAAB so we see a \\ | ||
+ | ABCACBABBACAAAABCACBABBACCAAB : 1001110010011100 \\ | ||
+ | is the full input in ternary and output in binary\\ | ||
+ | ABC ACB ABB ACC AAA ABC ACB ABB ACC AAB : 10 01 11 00 10 01 11 00\\ | ||
+ | to break it down farther we get \\ | ||
+ | ABC : 10 ACB : 01 ABB : 11 : ACC : 00 AAA : byte is finished pull next five tryte ABC : 10\\ ACB : 01 ABB : 11 ACC : 00 AAB : byte is finished and stop\\ | ||
+ | and finaly we end with a tryte to binary ending in C so\\ | ||
+ | ABCACBABBACCAAC : 1001110010011100\\ | ||
+ | break down by tryte \\ | ||
+ | ABC ACB ABB ACC AAC : 1001110010011100\\ | ||
+ | break down farther\\ | ||
+ | ABC : 10 ACB :01 ABB : 11 ACC : 00 AAC : 10011100\\ | ||
+ | |||
+ | Other thoughts: | ||
+ | |||
+ | This idea and concept opposes most conventional methods to process data and | ||
+ | can be and is confusing to someone who is looking at the standard binary | ||
+ | transistor that deals with only two states which i have no idea how to implement the idea | ||
+ | |||
+ | |||
+ | :DISCLAMER: | ||
+ | MIND YOU ALL OF THIS IS AN IDEA IN MY HEAD AND I ONLY USE A B AND C TO REPRESENT | ||
+ | THIS IDEA, IT COULD BE ANYTHING YOU WISH AND YOU DON'T HAVE TO AGREE OR EXCEPT | ||
+ | THIS IDEA! |