Slashdot Mirror


Beyond Binary Computing?

daksis writes "Non base two computing is nothing new. But it is an idea that, for various reasons, never really caught on. Embedded.com is running an op/ed piece that asks if hardware and software engineers are ready to move to ternary or quaternary logic. A move to multi-valued logic provides more computational capability without the standard increase in die size or transistor count. Is the need to make do with the current fabrication technology enough to drive the move to multi-valued logic? Or will Moore's law continue without the need for doing more with less silica based real estate?"

412 comments

  1. Truth Tables * n? by RobertB-DC · · Score: 4, Interesting

    I learned truth tables when I was a kid, and it was pretty simple:


    a and b = ?
    -----------
    0 and 0 = 0
    0 and 1 = 0
    1 and 0 = 0
    1 and 1 = 1


    But how would you make an AND gate for a trinary system? Would it be like multiplication with signs?


    a and b = ?
    -----------
    - and - = +
    - and 0 = 0
    - and + = -
    0 and - = 0
    0 and 0 = 0
    0 and + = 0
    + and - = -
    + and 0 = 0
    + and + = +


    And then quarternary... if it's just pairs of Boolean digits, no problem. It's just a four-input AND:


    a and b = ?
    -----------
    0x and 0x = 0
    0x and 1x = 0
    1x and 0x = 0
    x0 and x0 = 0
    x0 and x1 = 0
    x1 and x0 = 0
    11 and 11 = 1


    Or is the whole concept of an AND (OR, NAND, NOR, XOR) gate a relic of my Boolean thinking?

    --
    Stressed? Me? Of course not. Stress is what a rubber band feels before it breaks, silly.
    1. Re:Truth Tables * n? by leonscape · · Score: 1

      Youd probably need a TAND, i.e. 0 TAND 0 TAND 0 = 0 Its terniary three sets of everthing. Although Binary logic would still work.

      --


      If a first you don't succeed, your a programmer...
    2. Re:Truth Tables * n? by 26199 · · Score: 4, Interesting

      You're a relic, I'm afraid ;-)

      Binary operations can be carried out by considering whatever values you have to be binary numbers, and working from there. Binary operations would probably have to be implemented like that somewhere, because they're quite useful...

      Implementing binary operations using any base which isn't a power of two would, I suspect, be extremely painful...

      But arithmetic and other operations wouldn't have to be based around binary logic; it seems like the circuits might get horribly difficult to reason about, but with decent computerised tools that's hardly a problem...

    3. Re:Truth Tables * n? by stratjakt · · Score: 5, Informative

      The whole concept of AND/OR/NAND is a Boolean construct. The gates define the 16 functions that can be expressed by two boolean variables. Ternary or quarternary logic would more basic functions, and different ones, but it would be easy to implement boolean logic as well (like your quarternary example).

      Try reading this for a quick primer.

      It wont happen all at once, its a different paradigm and a definate learning curve, like the difference between imperative, functional and object oriented programming. But it has definate advantages, beyond the Moores law tripe.

      --
      I don't need no instructions to know how to rock!!!!
    4. Re:Truth Tables * n? by vitalitychernobyl · · Score: 2, Funny

      As the doc said to Marty McFly, "You're not thinking 4th demensionally"

      --
      Automatics are for old men
    5. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      Close... your multiplication with signs example is almost there. The problem with the other one is that you're trying to map quarternary logic back into binary. You would now have four distinct values: A, B, C, D. A truth table MIGHT be something like this:

      op1 AND op2 = ?
      ----------------
      A and A = B
      A and B = C
      A and C = D
      A and D = A
      -----------
      B and B = B
      B and C = D ...

      Other operators would be created and defined now that the numberical universe account for four states.

    6. Re:Truth Tables * n? by HiThere · · Score: 2, Interesting

      O, I don't know, what if the three values were:
      Yes, No, and Maybe?

      And for four values:
      Yes, No, Maybe, and error?

      Much beyond that and you start thinking in coarse probabilities. Go very far in that direction, and I will argue that you should eliminate the yes and no values. (I.e., nothing is either certainly true or certainly false.)

      There are probably other ways to parse the bit patterns. (I.e., I know there are several, but I don't remember them.) But that one makes sense to me without (much) translation. And you get to keep your and/or/etc. ops...they are just calculated slightly differently. I believe that and is something like (a * b) / (a + b) ... assuming that a and b are independant. It's not simple, but it's got lots of applications.

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    7. Re:Truth Tables * n? by Anonymous Coward · · Score: 1, Funny

      It wont happen all at once, its a different paradigm and a definate learning curve, like the difference between imperative, functional and object oriented programming. But it has definate advantages, beyond the Moores law tripe.

      BINGO!!!

    8. Re:Truth Tables * n? by Maimun · · Score: 5, Informative

      I have studied little multi-value logic. In m-valued logic: AND is minimum. OR is maximum. XOR is complement modulo m A friend of mine that was doing testing of multi-value circuits (purely theoretical work, of course) said that some phenomena are seen "more clearly" when the base is bigger than 2. HTH.

    9. Re:Truth Tables * n? by 26199 · · Score: 1

      True, true... it would be fun to play with a computer that had such things implemented quickly. Maybe come up with a version where you can run normal programs using fuzzy logic and see what happens ;-)

    10. Re:Truth Tables * n? by RLW · · Score: 2, Interesting

      The trinary algebra would work very similarly to binary or boolean algebra. Rank the values as true, ambiguous, and false. Then a TAND (trinary AND) would take on the value of of the lowest operand. The TOR would take on the highest value etc.

      However, the article was really talking about gaining extra memory capacity by using greater than bi-valent state memory. So then you would have some sort of mapping function - as described in the article - in which case from the user/developer stand point nothing would not really change except that the cost of the hardware may drop relative to performance.

    11. Re:Truth Tables * n? by Saeger · · Score: 4, Interesting
      But it has definate advantages, beyond the Moores law tripe.

      Tripe? Where do you get that from? Moore's observation about the exponential growth of transistor count is just a specific case of the more general Law of Accelerating Returns.

      Exponential growth isn't tripe-- it's historical trend that hasn't been broken in thousands of years.

      --

      --
      Power to the Peaceful
    12. Re:Truth Tables * n? by b!arg · · Score: 4, Funny

      Perhaps they would be Abort, Retry, Fail?

      --

      Everybody dies frustrated and sad and that is beautiful
    13. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      ohhhhh-

      But wouldnt that mean that by substitution...

      A and A and A and A and A = A

      Uh oh.

    14. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      not true you are baising your logic
      on the ordering or the lattice

      1
      |
      0

      there are other orderings (lattices) such as

      1
      / \
      a b
      \ /
      0

      all though this is not a total ordering
      it is important for some systems.

    15. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      I wish you singularity zealots would just drink a cup of shutthefuckup. PAST PERFORMANCE IS NOT INDICITIVE OF FUTURE RESULTS! Your almost as bad as the scientologists.

    16. Re:Truth Tables * n? by mindriot · · Score: 4, Interesting

      I think the whole point is not about changing the boolean logic, but merely changing the representation of numbers, such as considering a number as octal and thinking of the values 0..7 as different voltages. Building an adder of course requires new logic circuits, but no one will take away boolean logic from you.

      Besides, there exist many non-binary logic ideas with AND/OR etc. operations (such as the ternary Lukasiewicz logic), even continuous logic (see, for instance, the lecture slides here -- German unfortunately), but they are /not/ Boolean as they can not satisfy the Boolean axioms.

      So, for you writing software, nothing changes really... but internally, numbers would be represented differently. (Of course, when switching a whole CPU to n-valued calculation, you still need a way to do simple Boolean calculations since that is needed for conditionals.)

    17. Re:Truth Tables * n? by dillon_rinker · · Score: 1

      And then quarternary... if it's just pairs of Boolean digits, no problem. It's just a four-input AND
      Not quite. It's two two-input ANDs:

      a b a^b
      ----------
      00 00 00
      00 01 00
      00 10 00
      00 11 00
      01 00 00
      01 01 01
      01 10 00
      01 11 01
      10 00 00
      10 01 00
      10 10 10
      10 11 10
      11 00 00
      11 01 01
      11 10 10
      11 11 11

      If you could implement this in a single gate using 4-valued logic instead of two gates using 2-valued logic, you'd halve the number of gates.

    18. Re:Truth Tables * n? by russotto · · Score: 1

      For quintenary logic: Yes, no, maybe, "I don't care", and "Can you repeat the question". Seriously, they're just values. Like 0 and 1 in binary systems, they don't have any inherent meaning. The basic operations on trinary or quaternary values aren't obvious, the way they are in binary systems; there's too many to implement all of them, even the 1 and 2-operand ones.

    19. Re:Truth Tables * n? by Snorpus · · Score: 1

      Forget about how AND is defined for binary, just think about how AND is defined in logic:

      AND[1,1,1] -> 1

      AND[ Any of the other possibilities] -> 0

      OR[0,0,0] -> 0

      OR[ Any of the other possibilities] -> 1

      NOR[ anything ] -> ~ OR [Anything]

      NAND [anything] -> ~ AND [Anything]

      XOR [1,0,0] -> 1

      XOR [0,1,0] -> 1

      XOR [0,0,1] -> 1

      XOR [Anything else] -> 0

      Basic logic is not limited to boolean logic. It will take a time to adapt to it, but if it proves to be the way to improve performance, we'll do it.

      I suspect, 60 or 70 years ago, Turing and Atasanoff and Eckert and Mauchley and Perlis had to struggle a bit when they had to think in binary instead of decimal. IF trinary becomes common, those engineers real close to the hardware will have to worry about it. For the rest of us, it's bascially a non-issue.

    20. Re:Truth Tables * n? by arth1 · · Score: 2, Funny
      And then quarternary... if it's just pairs of Boolean digits, no problem. It's just a four-input AND


      While drunk once in my youth, I came up with diaboolean algebra.
      Instead of the boolean true/false, you have true, false, maybe and maybe not. The latter two are equal in interpretation (uncertainty), although with different values.

      diaboolean 0 = boolean 00 = false
      diaboolean 1/3 = boolean 01 = maybe not
      diaboolean 2/3 = boolean 10 = maybe
      diaboolean 1 = boolean 11 = true

      Of course, NOT maybe gives maybe not.
      "maybe or maybe not" is always true, just like in real life.

      Regards,
      --
      *Art
    21. Re:Truth Tables * n? by __aagmrb7289 · · Score: 1

      So, the dark ages, the plague, these things didn't happen? Oh, and less human-centric - the great kill-offs? Or are you being really specific, maybe talking about technology? If so, then what happened to the technology of concrete? Does the disappearance and redevelopment of this technology fit this upward scale? Or maybe, I don't know, maybe you can't point to a specific technology and have this work?

      Seems kinda likely that you can't point to much and have this "exponential growth" theory hold for long...

    22. Re:Truth Tables * n? by El · · Score: 1

      No, quaternary is just 2 two-input ANDs.

      --

      "Freedom means freedom for everybody" -- Dick Cheney

    23. Re:Truth Tables * n? by FuzzyBad-Mofo · · Score: 1

      Moores law is not tripe, but neither is it a "law of nature" as some people seem to believe.

      Here's a little secret: "Moores Law" is nothing more than Intel's marketing plan: double the number of transistors on an arbitrary piece of silicon every 18 months. So far, they've been able to do this. But they won't be able to do this forever.

      And for the record, multi-valued logic would absolutely need an increase in transistors. Even though their new transistor type could have a range of outputs instead of the regular 0 or 1, decoding the multi-valued outputs would require additional logic (or so I imagine, the article conveniently ignores this issue).

    24. Re:Truth Tables * n? by Saeger · · Score: 1
      Exponential growth is part of any evolutionary process, not just technology. The dark ages, plagues, dinosaur mass extinctions -- these were nothing but blips (S-curves, actually) in the overall exponential development of biological creatures. Nothing short of total extinction would have reset the trend since the progress is stored in DNA.

      As for concrete being rediscovered so long after the Romans first developed it - hey, that's background noise in overall trend.

      Read the paper I linked to when you've got a spare hour to kill.

      --

      --
      Power to the Peaceful
    25. Re:Truth Tables * n? by Saeger · · Score: 1
      But they won't be able to do this [doubling of transistors] forever.

      True, but as I said, Moore's law is just a specific case of the observed exponential trends in general. Moore's law will "hit the wall" when transistors can't shrink smaller than atoms, and it's at that point that a paradigm shift occurs to keep up the pace. This shift has already occured a few times.

      Maybe these diamond-substrate IC's are next? Or quantum computing? Who knows. All I know is that these trends tend to continue.

      --

      --
      Power to the Peaceful
    26. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      funny I didn't know xor was a logical operator

    27. Re:Truth Tables * n? by Snorpus · · Score: 1

      Why not?

      AFAIK, Exclusive OR means that the result is true, if one and only one of the arguments to XOR is true.

      That scales from any number of arguments, from 2 to N.

    28. Re:Truth Tables * n? by dmartin · · Score: 1

      The gates define the 16 functions

      Actually AND/OR and NOR take two inputs and give one output. The total number of inputs is 4 (=2 x 2). A function is a *complete* specification of these four inputs to outputs. As each input can have two values we have 8 (=2 x 4 = 2 x 2 x 2) functions from pairs of binary numbers to a binary number, not 16.

      (Includes some boring functions such as setting all values to zero).

      If we have n binary inputs and m outputs (usually m=1) then the total number of functions is 2^(n+m). In the case of AND/NOR et al we have n=2, m = 1 and the no. of functions = 8 as above.

      In ternary we now have 3^(n+m) functions, and if we have b numbers we have b^(n+m). In the case of the number of functions from 2 variables to 1 in a trinary system we have 3^3 = 27 and in a base 4 system we have 4^3 = 64.

      And for those that like to be really perverse we can have mappings from a "ring" b1 and another ring b2 in which case the number of functions is (b1^n) x (b2^m).....

    29. Re:Truth Tables * n? by Bsilenced · · Score: 1

      doesn't - and - = - ? or is it just me?

    30. Re:Truth Tables * n? by __aagmrb7289 · · Score: 1

      I'll go ahead and read the paper when I get the chance.. I've got to admit that I didn't. But I have to say, this is a predictable and rather unsatisfactory response. S curves and overall trends are like statistics - twist all you want, and maybe come out with something that you like. Ignore the facts at your peril however. These are hardly blips to be ignored "in the scheme of things"

    31. Re:Truth Tables * n? by DrJimbo · · Score: 1
      I vote for 16 functions not 8. Forget the high falutin' math for a moment. With m=2 inputs there are 2^m = 4 possible states that need to be defined for each function when we write out a truth table. Here is an example:

      A B OUT
      0 0 0
      0 1 1
      1 0 1
      1 1 0

      Since each of the four output states can take any one of two possible values there will be a total of 2^(2^m) = 16 possible different functions. In other words we can create 16 unique truth tables that contain 4 binary outputs.

      * I have a marvelous proof of this but there isn't enough room in this footnote to write out all 16 four-digit binary numbers.

      --
      We don't see the world as it is, we see it as we are.
      -- Anais Nin
    32. Re:Truth Tables * n? by Jace+of+Fuse! · · Score: 1

      (I.e., nothing is either certainly true or certainly false.)

      And everything you know is wrong!

      All hail Discordia!

      fnord

      --

      "Everything you know is wrong. (And stupid.)"

      Moderation Totals: Wrong=2, Stupid=3, Total=5.
    33. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      That's totally classic.

    34. Re:Truth Tables * n? by kirinyaga · · Score: 1

      By using signed ternary digits (-1 0 +1), you can keep the classic truth table for boolean needs (-1 is considered as +1) and benefits of the additional storage efficiency for numeric needs.

      --
      Kirinyaga
    35. Re:Truth Tables * n? by Grizzlysmit · · Score: 1
      But arithmetic and other operations wouldn't have to be based around binary logic; it seems like the circuits might get horribly difficult to reason about, but with decent computerised tools that's hardly a problem...

      You aren't a maths grad right?, anyone whose done boolean algebra, (from the maths end), knows that boolean algebra on anything other than a power of 2 is not just hard, it's nonsense, if you use anything other than 2^n for some n = 1, 2, 3, ... you can throw out all the boolean stuff.

      So since the first link was talking about ternary, makes this all a little silly, yes you could build such a machine, but good bye all the good stuff, it's not worth it, if there's any point to going multi-value (maybe there is), then it should be a power of 2, i.e. 2, 4, 8, ..., .

      --
      in my life God comes first.... but Linux is pretty high after that :-D
      Francis Smit
    36. Re:Truth Tables * n? by harrkev · · Score: 2, Interesting

      If you are interested (and you probably aren't) here's the breakdown for Y=A(?)B:

      2) constants (Y=true, Y=false)
      2) wire (Y=A, Y=B)
      2) NOT (Y=notA, Y=notB)
      2) AND/NAND (Y=AandB, y=AnandB)
      2) OR/NOR (Y=AorB, Y=AnorB)
      2) EQ/XOR (Y=AeqB, Y=AxorB)
      2) AND with an input inversion (Y=Aand(notB), Y=(notA)andB)
      2) OR with an input inversion (Y=Aor(notB), Y=(notA)orB)

      These are the 16 functions. Of course, the first two lines are skipped for obvious reasons and the last two lines are really combinations of the others plus a single inverter. The only "interesting" ones are NOT (which is really only a function of one input and so is a degenerate case), AND/NAND, OR/NOR, EQ/XOR.

      --
      "-1 Troll" is the apparently the same as "-1 I disagree with you."
    37. Re:Truth Tables * n? by harrkev · · Score: 1

      Congratulations. You have invented fuzzy logic with only four discrete values.

      --
      "-1 Troll" is the apparently the same as "-1 I disagree with you."
    38. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      Yeah ... but it's just an observation and not necesarily a "fact" for all time. Hence, no-one can really call it a "law" in the first place!

      "Moore's Law" was just a media-friendly name to a pattern some random guy happened to observe which has unjustly been blown out of all proportion by the media. (as is typical of clueless tech-industry writers). Unfortunately ... the name simlpy stuck.

      "Moore's Law" *will* be broken and proved as useless and meaningless as it is at some point in time, because that's all it takes ... time.

      it's gonna happen eventually ... and "moore's law" will mean what it actually is now : nothing. a meaningless void of media-friendly sound-bites... that, my friend is what "Moore's Law" really is.

    39. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      Oh no, someone is questioning your beloved Wired buzzword. Go choke on your cheetos, you pathetic excuse for a living sweatstain.

    40. Re:Truth Tables * n? by HiThere · · Score: 1

      Yes. They're arbitrary values. But this means that you can assign them such values as you find convenient.

      E.g.: What would you do with a 256 value system?
      (Hint: Conventional Boolean logic is the least part of what you would do...but it would be included.)

      --

      I think we've pushed this "anyone can grow up to be president" thing too far.
    41. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      No, there are 16 functions. Is this a troll?

    42. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      Computers use binary because of their basic construction. Transistors 1=On 0=Off. Other states are rejected. No matter how the software uses it you're always using 1 and 0 binary on a hardware level. Those who are old enough to remember opamp computers know that any signal 0 to 1 volt can be computed (compared). if you like plugging in cables all your life, build an op-amp computer after tons of wire and power supplies and patches you may have a pong game that can compute in analog! :-) Good luck with speed.

    43. Re:Truth Tables * n? by 26199 · · Score: 1

      Nope, a computer science undergrad...

      I didn't say you'd design the circuits using boolean algebra... you'd have to come up with something new, and it probably wouldn't work very well. Hence the need for computerised tools :-)

    44. Re:Truth Tables * n? by Anonymous Coward · · Score: 0

      And I wish you illiterate schoolkids would learn the difference between your and you're, or how to spell words you seem to think are impressive, like indicative (you don't use the word indicite, do you?)

      But hey, I don't think either of us is going to get what we want.

  2. hu by gsparrow · · Score: 0

    More logic than I understand

  3. The Star Trek chronicles... by Anonymous Coward · · Score: 3, Funny

    ...prove we will be using a quaternary system. How many gigaquads of hard drive storage do we need, anyway?

    1. Re:The Star Trek chronicles... by Gherald · · Score: 2, Informative

      > The Star Trek chronicles prove we will be using a quaternary system. How many gigaquads of hard drive storage do we need, anyway?

      A "quad" does not refer to "quaternary," but is just a unit of storage space. It it not known how many bytes are in a quad.

      It is common knowledge among trekkies that the term was invented specifically to avoid describing the data capacity of Star Trek's computers in 20th century terms. It was feared by technical consultant Mike Okuda that any such attempt would look foolish in just a few years, given the current rate of progress in that field.

    2. Re:The Star Trek chronicles... by bumby · · Score: 2, Funny

      Number of girls times number of possible different poses times times avarage jpeg-filesize for pr0n image

      about that much storage we need ;)

      --
      Hey! That's my sig you're smoking there!
    3. Re:The Star Trek chronicles... by Anonymous Coward · · Score: 1, Insightful

      God, I'm assuming you get more ass than J-Lo's jumpsuits.

    4. Re:The Star Trek chronicles... by ncc74656 · · Score: 1
      A "quad" does not refer to "quaternary," but is just a unit of storage space. It it not known how many bytes are in a quad.

      <voice style="comic-book-guy">
      Of course "quad" is defined...look it up in the TNG tech manual.
      </voice>

      (I'd look it up, but mine's at home. The implications of these statements on my having a life are an exercise left for the reader.)

      --
      20 January 2017: the End of an Error.
    5. Re:The Star Trek chronicles... by TexVex · · Score: 1
      It was feared by technical consultant Mike Okuda that any such attempt would look foolish in just a few years
      And that was very wise of him. Remember Max Headroom? Max only occupied about 64 MB of RAM. Of course when that show was made, typical home computers had 64K of RAM. Supercomputers of the time had 64 MB of RAM.
      --
      Fun with Anagarams! LADS HOST, SHALT DOS. HAS DOLTS. AD SLOTHS, HATS SOLD. ASS HO, LTD.
    6. Re:The Star Trek chronicles... by los+furtive · · Score: 2, Funny

      Remember Max Headroom? Max only occupied about 64 MB of RAM

      Then why do we even bother with Microsoft Agent? At least Max's electronic voice is forgivable.

      --

      I'm a writer, a poet, a genius, I know it. I don't buy software, I grow it.

    7. Re:The Star Trek chronicles... by Gherald · · Score: 1

      Actually I have read that manual (at the local library, years ago). They did some interesting calculations to figure out how big a quad must be, based an all availeable Star Trek data, but it was all strictly unofficial. I wish I could remember the exact amount.

    8. Re:The Star Trek chronicles... by Anonymous Coward · · Score: 0

      what?

    9. Re:The Star Trek chronicles... by TonyMillion · · Score: 1

      but what about that infernal stutter, it would be nearly as annoying as clippy....

    10. Re:The Star Trek chronicles... by Foolhardy · · Score: 1

      I always thought "quad" meant quadrillion, and that gigaquad meant 10^9*10^15=10^24. Or I guess they could just say septillion (10^24).

    11. Re:The Star Trek chronicles... by Gherald · · Score: 1

      A quadrillion bits or bytes you might think, but alas that is not the case

    12. Re:The Star Trek chronicles... by Foolhardy · · Score: 1

      I guess I was thinking bits, but you are right about the 'trek designers wanting to use a nebulous term that won't look obsolete.

    13. Re:The Star Trek chronicles... by Wolfrider · · Score: 1

      Infernal? That was part of his charm! Actually I bet you *could* do Max Headroom in 64MB now...

      --
      .
      == WolfriderV6 == I'm willing to admit that *I just might* be wrong... Are you??
  4. Qubits by canadiangoose · · Score: 2, Interesting

    Aren't quantum computers built around quaternary logic using qubits instead of bits?

    --
    Never eat more than you can lift -- Miss Piggy
    1. Re:Qubits by leviramsey · · Score: 1, Offtopic

      I'd like to see a Qubit-based version of Qubert, myself...

    2. Re:Qubits by 26199 · · Score: 2, Informative

      Er. That's q for quantum, not q for quaternary.

      I hope that was a joke :-P

    3. Re:Qubits by Anonymous Coward · · Score: 3, Informative

      No.

      Qubits are bit which can be zero, one, or zero AND one both at the same point in time (although, in order to be measured they must collapse down and become either zero or one).

    4. Re:Qubits by Mr+Z · · Score: 1

      Yes, kinda. What's interesting w/ qubits, though, is that they're more like "complex bits" than two-bit values. That is, they're like a unit vector that can point one of four equally spaced directions.

      Oddly, most quantum math, though, seems to use three-valued logic. I never quite understood that. One of the guys I worked with was doing his PhD on quantum computing, and he'd wander by with all sorts of neat stuff. Much of it was truth tables based around a balanced three-valued logic employing "-1, 0, +1". My best understanding of it was that these values represented the projection of a qubit onto an axis, but I am likely wrong.

      The most fundamental gate in a quantum computer is the "square root of NOT" gate. Running a 0 through it gives an unknown value. Running the unknown value through a second such gate gets you a 1. Going back to the "four direction vector" idea above, you can think of this gate as a "rotate 90 degrees" gate.

      More information from Google.

      --Joe
  5. Trinary Computing by Liselle · · Score: 5, Informative

    Didn't the Soviets already do this? I don't remember it catching on very splendidly, though I guess than can be chalked up to the limitations of the times.

    --
    Auto-reply to ACs: "Truly, you have a dizzying intellect."
    1. Re:Trinary Computing by Ophidian+P.+Jones · · Score: 1

      in soviet russia, trinary computes YOU!

      Why was this marked troll? It isn't one. Offtopic would probably have been the best moderation, or perhaps just overrated.

      This moderation is getting marked as "unfair" in M2 if I see it.

    2. Re:Trinary Computing by DataPath · · Score: 5, Interesting

      The reason for doing work in trinary computing is that it is closest to the theoretically optimal computing base. The reasoning was something like this:

      Representations of numbers in a particular base have two defining characteristics - the number of values that can occupy a digit (m), and the number of digits it takes to represent that value (n).

      (Here's where the theory takes a leap, at least to me) The most efficient base (or simplest) base for performing computations is the one at which the m*n product is minimized. As an example, we'll take THE ANSWER, 42(base10).
      THE ANSWER in base 16 has a result of 16*2=32
      THE ANSWER in base 10 has a result of 10*2=20
      THE ANSWER in base 8 has a result of 8*2=16

      Here are the interesting cases, though:
      THE ANSWER in base 2 has a result of 2*6=12
      THE ANSWER in base 3 has a result of 3*3=9
      THE ANSWER in base 4 has a result of 4*3=12

      IIRC, according to the article I was reading, the most effective base is actually "e" (euler's constant).

      --
      Inconceivable!
    3. Re:Trinary Computing by Anonymous Coward · · Score: 0

      The moderator didn't know whether it was Offtopic or not... and since it couldn't very well have been left as Un-moderated for such a GREAT comment, so the Tro.... Maybe choice was used.

    4. Re:Trinary Computing by isomeme · · Score: 5, Informative

      The most effective base being e is not coincidental. Consider that the number of digits required to represent a number is proportional to the log to the base in use of that number. Since e is the base of the natural logarithms, with the property that the slope of the curve e^x equals e^x for all x, the product of a base and the logarithm of any number to that base will always reach a minimum for base = e.

      --
      When all you have is a hammer, everything looks like a skull.
    5. Re:Trinary Computing by Snorpus · · Score: 4, Insightful

      Here's why (I think) the minimum of m*n is considered optimal:

      Each additional "base" value takes more complex circuitry (base 2 being the simplest).

      But for small values of the base, we need more "bits" to represent a given value. A single hex value can represent the same number as four binary values.

      Those of us old enough to remember using octal notation probably remember wishing that getting to 7 as a largest value was getting close, but not quite, to 9.

      Binary (base 2) was adopted in the early days of computers because (1) electronically it was very easy to design circuits that either were saturated (max current) or cut-off (zero current), and (2) Boolean algebra had been around for 200 or so years, making the transition straightforward (although not easy).

      It's been a long time since I took a semiconductor course, but I would think that a tri-state logic circuit (using -1.5V, 0V, and +1.5V, for example) should be fairly straightforward today.

      Yes, truth-tables and such would become much more complicated, and de-Morgan's theorem would be relegated to the scrap heap, but it would seem to be a way to continue to increase processing power once Moore's Law begins to poop out as feature sizes become sub-atomic.

      Moore's Law itself could continue, just taking advantage of better technology to move to quad-bit, penta-bit, and so forth, computing.

      In deference to those who might be easily offended, I have abstained from using the obvious acronym for a 3-state digit.

    6. Re:Trinary Computing by Josuah · · Score: 2, Interesting

      e is an irrational number. How do you get e possible choices for a single digit?

    7. Re:Trinary Computing by nurbman · · Score: 1
      Sorry to nitpick but wouldn't the base 3 result be: 3*4=12 ?

      42 in base 3 would be: 1120

      You can see that the minimum is somewhere between 2 and 4 though. Base e makes sense.

    8. Re:Trinary Computing by BRSQUIRRL · · Score: 1

      e (2.17828whatever) is Napier's Constant, not Euler's Constant.

    9. Re:Trinary Computing by DataPath · · Score: 1

      you are correct. I overlooked the last digit, being a zero, as I was doing the conversion on my fingers. So they're all very close, and on the real numberline, you get the greatest efficiency a "e".

      --
      Inconceivable!
    10. Re:Trinary Computing by Pr0xY · · Score: 1

      obviously you can't, but base 3 is closer to e than base 2, hense it is "more" optimal, in fact is the the most optimal we can get (looking at it from a storage/representation persepective)

      proxy

    11. Re:Trinary Computing by DataPath · · Score: 1

      Hmmm... You're right. That's a new one for me. Named "e" in HONOR of Euler, but it is NOT Euler's constant. Typing "Euler's Constant" into google gives a Google Calculator result of "Euler's constant = 0.577215665"

      You learn something new every day

      --
      Inconceivable!
    12. Re:Trinary Computing by Grishnakh · · Score: 1

      But what about when we dump voltage as a means of value representation, and switch to quantum computing where values are represented by the spin of subatomic particles? Since spin can only have two states (CW and CCW), we'll have to switch right back to base-2, deMorgan's theorem, etc.

    13. Re:Trinary Computing by megastar · · Score: 1

      But quantum computing offers more options than binary system based on particle spin. For instance, the example always given is a system based on quark flavors, of which there are six.

    14. Re:Trinary Computing by kirinyaga · · Score: 1

      spin of the electron can only have 2 values. The number of values the spin can take varies with each particle. Thus you can have qutits (quantum ternary digits) or qunits in general (quantum n-ary digits)

      --
      Kirinyaga
    15. Re:Trinary Computing by Zirnike · · Score: 1

      Quantum spin doesn't work that way. It's not 'a rotating quark' that can go CW or CCW (as electrons have spin, and they are point sources). Check out spin here.

      --
      I'm not shy, I'm stalking my prey
    16. Re:Trinary Computing by pmz · · Score: 1

      ...the product of a base and the logarithm of any number to that base will always reach a minimum for base = e.

      Uh...good idea! And, uh, since you seem pretty smart, and, uh, you came up with the idea...I think you are best qualified to implement our new base-e microprocessor!

      (I hate when my meetings go like this)

    17. Re:Trinary Computing by bar-agent · · Score: 1

      You know, at times like this, I truly believe that mathematicians have an unhealthy interest in numbers.

      --
      i'd hit it so hard, if you pulled me out you'd be the king of britain [bash.org]
  6. Sounds like a good idea. by digital+bath · · Score: 5, Interesting

    Looks like systems working with more than ones and zeros would just need a way to encode these different values with different strengths of signals (as opposed to off=0, on=1). Something like no voltage=0, 1/3 voltage = 1, 2/3 voldage = 2 and 3/3 voldage=4. Seems like a very good way to wrap more information in the same signal/clock, but how would the logic work? How would and/or/xor work?

    My mind is too used to binary :) But I'd be willing to learn..

    Sounds like a good idea.

    --
    find / -name "*.sig" | xargs rm
    1. Re:Sounds like a good idea. by digital+bath · · Score: 1

      err, I meant 3/3 voltage=3

      --
      find / -name "*.sig" | xargs rm
    2. Re:Sounds like a good idea. by Sparr0 · · Score: 4, Interesting

      How about + voltage, no voltage, - voltage? Thats the most basic way to implement ternary logic into electrical circuits.

    3. Re:Sounds like a good idea. by Anonymous Coward · · Score: 0

      Well as long as you're on board I'm sure it will take off.

    4. Re:Sounds like a good idea. by digital+bath · · Score: 1

      because my binary-oriented mind doesn't like the thought of a base-3 system :P 4 makes a little more sense.

      --
      find / -name "*.sig" | xargs rm
    5. Re:Sounds like a good idea. by Anonymous Coward · · Score: 0

      Seems like switching between -3 & +3 volts will raise "capacitive" response-time effects larger than say, 0 ->+3 volts.

    6. Re:Sounds like a good idea. by Anonymous Coward · · Score: 0

      How would and/or/xor work?

      For any integer base, there are a fixed set of logical functions for that base. For base-2, there are 16 functions that take two arguments. Not all of these translate into terribly useful functions, but some do (like and/or/xor/nand).

      We would have to make a decision for ternary about how many arguments each function takes. If we let each function take two arguments, we have 729 functions. More natural perhaps would be to let each function take 3 arguments. Then we'd have 19683 functions.

      If we say 'b' is the number of digits in a base, and 'n' is the number of arguments to each logical function, then we have the general formula of b^(b*n) functions. (I think that's right, correct me if I'm wrong.)

      Not all of these functions will be useful, but some of them will be. The concept of and, xor, or, etc. still work just fine. But there might be other functions that are useful in the ternary world.

    7. Re:Sounds like a good idea. by skwirlmaster · · Score: 1

      I agree, but here is the real question:

      If Via was first to market with a trinary chip do you think they would be competitive? :)

      --
      My inner self is ineffable, so don't eff with me.
    8. Re:Sounds like a good idea. by Nucleon500 · · Score: 1
      I don't think it would need to be an entire system, because you can freely change the implementation within a component. Which gets used more becomes a circuit design issue more than anything.

      Consider an adder. It's easy to make a binary adder. It's possible to make a base-n adder and convert bases on input and output. If the chip designers can make a more efficient (power use, speed) adder with trinary, doquaddecary, or magic smoke, I'm happy.

      Consider that about the only thing we use boolean algebra for is bit-masking. I think those sections of the circuit would just be implemented in binary, as I can't see base-n being more efficient for that.

    9. Re:Sounds like a good idea. by sribe · · Score: 1

      Looks like systems working with more than ones and zeros would just need a way to encode these different values with different strengths of signals (as opposed to off=0, on=1). Something like no voltage=0, 1/3 voltage = 1, 2/3 voldage = 2 and 3/3 voldage=4. Seems like a very good way to wrap more information in the same signal/clock...

      How about + voltage, no voltage, - voltage? Thats the most basic way to implement ternary logic into electrical circuits.

      So, I guess you two just felt compelled to prove that you know absolutely nothing about electronic circuits? Continuing in the finest /. tradition of commenting on things without bothering with the pesky prereq of acquiring a little knowledge.

      OK, enough with the sarcasm. Here's a very real suggestion:

      1) Go off and invent a simple circuit (comparable in complexity to the transistors currently used in integrated circuits) capable of of the kind of switching you were describing.

      2) Patent it and license it.

      3) Get very, very rich.

      4) Win Nobel prize in physics.

      Good luck; I think you will both need it ;-)

    10. Re:Sounds like a good idea. by dinog · · Score: 1
      Something like no voltage=0, 1/3 voltage = 1, 2/3 voldage = 2 and 3/3 voldage=4.

      Three, sire.

      Dean

      And five is right out.

    11. Re:Sounds like a good idea. by B.D.Mills · · Score: 1

      Yep, and it also works well if you encode numbers like this:

      Your digits are -1, 0, 1 (which I will simplify as -, 0, +)
      Your place values are powers of 3

      Then your numbers are easy to express:

      5 = +-- = 9 - 3 - 1
      -17 = -+0+ = -27 + 9 + 0 + 1

      etc.

      --

      The only thing necessary for the triumph of evil is for good men to do nothing. - Edmund Burke
  7. Moore's Law and Silica by zillyorg · · Score: 0, Offtopic

    Silica? Who needs silica? We are going to diamonds!!

    1. Re:Moore's Law and Silica by ModernGeek · · Score: 1

      I know that might sound a little off topic, but it seems if it can handle more electricity/heat/etc, there is more room for more variations of electricity for them to use to create a higher base system, say the silica could only old 1V, well for a base-4 number system, it would be 1/4 V, 1/2 V, 3/4 V, 1V, however if you could handle more heat and such, you could use up to 4V, so 1V, 2V, etc... So, could diamonds help pioneer this concept, or am I just ignorant?

      --
      Sig: I stole this sig.
  8. Nice by bo0ork · · Score: 0

    When the machine works with 0 ... 1, and all values in between are possible, then we'll be a lot closer to how our brains work, and neural networks in general. Of course, getting 2 + 2 equal 4 every time might not be a given.

    --
    Does everything include nothing?
    1. Re:Nice by stratjakt · · Score: 0, Redundant

      Babbage's analytical engine? (It did calculus using analog circuits and was as big as yo momma, before the days of the modern computer)

      --
      I don't need no instructions to know how to rock!!!!
  9. Ternary by Anonymous Coward · · Score: 5, Informative

    For reference, Slashdot has done two other stories on ternary computing here and here.

    1. Re:Ternary by borgboy · · Score: 4, Funny

      So, /. has done 3 stories on ternary logic?

      --
      meh.
    2. Re:Ternary by Anonymous Coward · · Score: 0

      So, /. has done 3 stories on ternary logic?

      You made a math error. 2+1=10, not 3.

    3. Re:Ternary by gouva111 · · Score: 1

      So, /. has done 10 stories on ternary computing?

    4. Re:Ternary by Stevedust · · Score: 1

      no, it's done 10 :)

    5. Re:Ternary by Thuktun · · Score: 1
      • So, /. has done 3 stories on ternary logic?
      • no, it's done 10 :)

      The sad thing is that I just had to explain this joke to someone who claims to be a geek.

  10. Farewell to 'The joy of hex' by The+Famous+Druid · · Score: 1

    In trinary, there'd be no more hex digits, you'd have to chose betwween base 9, and base 27 representation of numbers.

    After 20 years in the biz, my brain is hard-coded for hex, I'd have to retire.

    --
    Quidquid Latine dictum sit, altum videtur (anything said in Latin sounds important)
  11. Ternary system is the way to go by a_ghostwheel · · Score: 5, Insightful

    It's been a long time since I read an article about that, but AFAIK ternary system is most efficient in storing information (basically if you want to store numbers 0..700, you need 28 states (8+10+10) for decimal system, 20 states (10*2) for binary and 18 for ternary (6*3). This has something to do with 3 being closest to the value of e (2.718...) but I dont remember what exactly. Any /.-ers to fill in?

    1. Re:Ternary system is the way to go by Andorion · · Score: 5, Informative

      Here's a link to what you're talking about:

      Third Base

      It's a good read, stuff I didn't know until I read your post and looked it up =)

      ~Berj

    2. Re:Ternary system is the way to go by Vann_v2 · · Score: 1

      Here is an article about why base-e is the most "efficient" continuous base, and thus base-3 becomes the most "efficient" integer base. It also explains a bit (har har) about ternary logic.

    3. Re:Ternary system is the way to go by danila · · Score: 2, Interesting

      But I don't think this fact has any important practical consequences. If you store something on a CD, you would obviously be able to fit the same amount of data on the disk, regardless of what base you use. Of course, if you could use another technology (one dot on a CD being a value in a different base, not just on or off), then decimal would be much better than ternary. ;)

      Of course, if you are talking about processing information (CPU vs. RAM), ternary system is a little bit better, but the advantage over binary is very small, IIRC - about 10% may be. Not worth the hassle, I would say, unless there are other advantages.

      --
      Future Wiki -- If you don't think about the future, you cannot have one.
    4. Re:Ternary system is the way to go by Mechanik · · Score: 4, Funny

      Here's a link to what you're talking about:

      Third Base


      There is just something funny about the concept of Slashdotters needing to follow a hyperlink in order to get to third base...


      Mechanik

    5. Re:Ternary system is the way to go by spectral · · Score: 1

      So wait, if a bit is a Binary digit, what would a Trinary digit be? No wonder us geeks never got computers to third base ;)

      And after writing that I think the horrible puns and misnomers have made me suicidal. So long slashdot!

    6. Re:Ternary system is the way to go by Anonymous Coward · · Score: 0

      ternary system is most efficient in storing information ... also note that storage efficiency does not imply computational efficiency. And neither of those imply throughput (where bus speeds (memory, video, etc) seem to be the biggest bottleneck in modern desktops). It's always important to know what problem you actually want to solve before settling on a solution.

    7. Re:Ternary system is the way to go by jelle · · Score: 2, Informative

      Umm... But if you want to store numbers 0..1000, you need 32 states (2+10+10+10) for decimal systen, 20 states (10*2) for binary, and 21 for ternary (7*3).

      So I say that that reasoning does not prove that base 3 is 'more efficient'.

      Btw what does 'more efficient' mean in this context: less power usage? lower cost? more girls? ...

      --
      --- Hindsight is 20/20, but walking backwards is not the answer.
    8. Re:Ternary system is the way to go by dasmegabyte · · Score: 1

      I think it's supposed to mean "fewer instructions to perform the same task." It could also mean stronger bitstrength. Your 1-1000 example was kind of crap...try it again with 1,000,000,000,000 and you get 60 states for base 2 vs 39 for base 3, a pretty good savings. In 64 bit computing, your max int in base 2 is 18446744073709551616. Your max int in base 3 is 3433683820292512484657849089281. A 32 bit ternary system would have 1853020188851841 distinct values, which is only 10,000 off from the 64 bit binary! Meaning greater precision with less storage for roughly equivalent precision, all in a system with greater reliablity and less complexity.

      That's a good idea. Now, the trouble comes when you realize that ternary logic is much more complex than binary, resulting in more circuitry per bit. It requires more and cleaner power with more switches. I have to wager that in the end it's not worth the hassle. But it would put us in good with the aliens from Rama, the Robotech Masters, etc.

      --
      Hey freaks: now you're ju
    9. Re:Ternary system is the way to go by jelle · · Score: 1

      "Your 1-1000 example was kind of crap...try it again with 1,000,000,000,000 and you get 60 states for base 2 vs 39 for base 3, a pretty good savings."

      Ok, I'll try it again with "1,000,000,000,000". In scientific notation, that number is 1e12 (for easier calculations).

      And you think that 1e12 is 39 states for base 3?.

      3^(39/3)=1594323. 1.6e6... That's hardly 1e12.

      Actually, 3^26=2.54e12, hence "1,000,000,000,000" is 26*3=78 states... That is more than the 60 states for base 2.

      Math, hmm?

      The rest of your reasoning would equally prove that base 4 is better than base 3.

      And a 'bit' implies base 2, so you can's talk about 3-value symbols and call it a 'bit'. So assuming that by 'n bit ternary' you mean 'n symbol radix 3' -> Sure, a higher radix for the symbols results in less symbols (smaller words) for the same values, but that is not less storage, because the symbols are more complicated, storing more information per symbol. Shannon's Information theorem still holds, it's just that one radix 3 symbol can store more than one bit of information.

      --
      --- Hindsight is 20/20, but walking backwards is not the answer.
    10. Re:Ternary system is the way to go by randomencounter · · Score: 1
      Umm... But if you want to store numbers 0..1000, you need 32 states (2+10+10+10) for decimal systen, 20 states (10*2) for binary, and 21 for ternary (7*3).
      And if you want to store the numbers from 0..1025 you still only need 21 states for Ternary, but you need 22 states for Binary. Once again conclusively proving that if you let me pick any numbers I want I can prove anything I want to.

      Q.E.D.

      --
      Forget diamonds, copyright is forever.
    11. Re:Ternary system is the way to go by jelle · · Score: 1

      That was my point to begin with. What are you doing stealing my point? ;-)

      --
      --- Hindsight is 20/20, but walking backwards is not the answer.
    12. Re:Ternary system is the way to go by jelle · · Score: 1

      From the article: "An obvious strategy is to minimize the product of these two quantities."

      Mr Brian Hayes is assuming equal cost for a state anywhere in the 'rw' space. That is much too simplistic to be a practical model.

      Luckyly he shows that he realizes that later on by saying "Everything hinges on the assumption that rw is a proper measure of hardware complexity". And I'll make my argument below that that indeed is not a proper measure at all. You can agree with me and dismiss that 'base 3 is the most efficient' and skip the rest of this post, or read on and find out why I think that it is bogus to say that the terniary system or base-e is 'the most efficient'.

      To begin with, what does he mean when he says 'An obvious strategy is...'? Sure it's a simple strategy, but that doesn't have to mean that it is the correct one for the task at hand. For a deer it's an obvious strategy to look at the headlights of the approaching car....

      Actually, I have been told and have found in my own experience that if an article says that something is 'obvious' without further explanation, usually that is exactly the main flaw of the 'proof' that is presented (but to be honest, when people start to talk about rumors, or their 'experience', that usually means something similar, so please ignore this paragraph ;-))

      After stating what he believes is obvious, he goes on on that premise without explaining why minimizing 'rw' equals to finding the highest 'efficiency'...

      I my dictionary, efficiency in this context is the cost to use the number representation in computational tasks. Then I go further assuming that the cost is mainly a function of power usage, implementation size, and circuit speed. That is what I mean in the rest of this posting when I say 'efficiency' (yes even my model is too simplistic for practical use, because I don't specify the exact relationship of power, size, and speed in the 'efficiency' equation).

      In practical implementations the cost per state is never the same for all symbol sizes. Actually, each state may have its own cost due to things like current leakage (actually: not just the number of total states to represent a value, but also the number and type of state transitions need to be analyzed to determine the efficiency).

      Efficiency of a number representation system is very much linked to implementation. In today's silicon with the transistors we have today, base 2 is the most efficient. 'Why?' Well, that is because adding more states to the value of a signal would make the circuits that switch them sufficiently larger, slower, and more power hungry that the end result would be a less efficient circuit.

      Some materials researchers have been talking about base 4 logic, because they think they may be able to use the electon spin as well as the current so carry the information in an electrical signal. In semiconductors that could very well double the information carrying capacity of switching signals without increasing the power usage or transistor size in semiconductors. Hence, more switched information per joule, hence better efficiency. For such a chip production process, that would result in base 4 being the most efficient, still not base 3.

      Besides all that, for performing computations it's not just the value storage in symbol states that is important for the efficiency, but the symbol state transition is often an even more important parameter for efficiency in computations.

      When counting in a base 2 system, we have less than 2 symbol state transitions per step (the lsb changes every step, the next bit every other step, the next bit once every 4 steps, etc). Similarly, in base 3 we have less than 1 2/3 symbol state transitions per step, and in base 4 we have less than 1.5 symbol state transitions per step). Now we still need to know how much does symbol state transition costs in base 2, 3, or 4. Without that we don't know the efficiency. We can guess and say that a symbol state transition costs 1 units when

      --
      --- Hindsight is 20/20, but walking backwards is not the answer.
  12. Quaternary or ... by marcovje · · Score: 2, Interesting


    I don't see why software would have to deal with
    quarternary logic at all.

    Currently the assembler- hardware logic is already an abstraction (microcode).

    If only the main busses (address bus, data bus, and their modern counterparts) would simply use that, and elementary pieces like barrelshifters would
    be quaternary, one could severely limit the number of lines (and thus transistors)

    However it could be that because of tolerance problems quaternary logic elements have to be larger, and thus don't yield the big benefit one would expect.

  13. How about true decimal? by Atario · · Score: 1

    Base-10 math? Not bits, but actual digits? All the benefits of BCD with none of the overhead.

    On the other hand, 7-bit ASCII now needs three digits -- 300 values, wasting 172 values, more than have the value-space of a byte ("bydte"?).

    Don't even begin to ask UNICODE to retool for this.

    --
    "A great democracy must be progressive or it will soon cease to be a great democracy." --Theodore Roosevelt
    1. Re:How about true decimal? by mishac · · Score: 1

      Actually if it was base ten, it would require 3 decimal BITS (bidts?) not bytes, so it would waste less bits than implementing it in Binary ,where it requires 8 bits.

  14. trinary computer by Anonymous Coward · · Score: 0

    According to some science, base 3 computers would be the most efficient (closes to e). Does anyone has that article?

    1. Re:trinary computer by UfoZ · · Score: 0

      A quick google search gave this.

    2. Re:trinary computer by TonyMillion · · Score: 1

      I've read that, there were spots that were bad, but overall it was a smooth, if slightly large, read...

  15. Not Moores Law by Hamfist · · Score: 1

    It's critical mass behind existing systems.

    Take a look at the Itanium. It's not taking off because not enough people 'get' EPIC, and moving to that platform is a lot of work. The speed benefits for a full migration to Itanium are quite large, but nobody wants to hand-tune their millions of lines of code.

  16. Its not a smart move at all by Grieveq · · Score: 3, Insightful

    Increasing the number of states requires you to increase the overall voltage required of the device to acount for noise in the system. So in return for more states you are running at a higher voltage and thus at a higher power consumption level. You still have the same problem.

    1. Re:Its not a smart move at all by ansible · · Score: 2, Insightful

      Well, for ternary computing, you could do -3.3 V, 0V and 3.3V. So you don't actually need higher absolute voltage levels.

    2. Re:Its not a smart move at all by wirelessbuzzers · · Score: 1

      Yes you do, as at some point you'll have a connection between the + and - rail and get 6.6V.

      --
      I hereby place the above post in the public domain.
    3. Re:Its not a smart move at all by edwinolson · · Score: 1

      It's not absolute voltage that's the problem, it's the voltage change required.

      Each gate output has a capacitance. Every time the output of a gate changes, that capacitance has to be charged up or down, and this takes energy. If the change in voltage is big, it takes more energy. (.5*C*V^2, even).

      Transitioning the output of a trinary circuit element from -3.3V to 3.3 (a change of 6.6V) requires a lot of energy.

      Of course, this is obvious at a glance. a -3.3V to +3.3V is exactly the same thing as a 0 to 6.6V system because voltage is always relative.

    4. Re:Its not a smart move at all by aXis100 · · Score: 2, Interesting

      As I said in this post, it doesnt have to be like that. You're still thinking two dimensional.

      eg
      * red, green, blue
      * apples, lemons and bananas.

      All perfectly unique, all one move away, no intermediate transitions. The trick is finding an electrical equivalent.

      Another analogy is to imagine points in space - eg trinary could be a set of points in two dimensional space, quaternary logic a set of points in three dimensional space etc.

    5. Re:Its not a smart move at all by dasmegabyte · · Score: 1

      Except that you'd need twice as many lines and switches to do this shit. Because -3.3V moves BACKWARDS.

      --
      Hey freaks: now you're ju
    6. Re:Its not a smart move at all by Zaak · · Score: 1

      All perfectly unique, all one move away, no intermediate transitions. The trick is finding an electrical equivalent.

      I think we should use two wires for each symbol, with each wire carrying [-1,0,1]. That gives 9 possible combinations. If you define 0,0 as "no symbol present", you get 3 bits on 2 wires with a guard state to use for transitions.

      TTFN

  17. si by Anonymous Coward · · Score: 0

    no tiene bananas HOY!

  18. Power by overshoot · · Score: 4, Interesting
    The big limit on device complexity and speed now isn't transistor count, it's power. CMOS and related gates have relatively low power because when they're conducting they don't have (much) voltage across them and when they have voltage across them they're not conducting (much).

    If you go to multilevel logic (not just on/off) then you're necessarily going to have intermediate states which both conduct and have voltage across them, with the resulting dramatic increase in power. This is an acceptable tradeoff for charge-storage devices like memories but a non-starter for logic.

    --
    Lacking <sarcasm> tags, /. substitutes moderation as "Troll."
    1. Re:Power by MyHair · · Score: 1

      If you go to multilevel logic (not just on/off) then you're necessarily going to have intermediate states which both conduct and have voltage across them. . .

      I'm probably talking out of my ass here, but you've got to admit it's a great trick.

      Couldn't the three states be no voltage, positive voltage and negative voltage--without an increase in power consumption?

    2. Re:Power by geekee · · Score: 1

      Exactly. It's really a circuit problem, not a device problem, as the author implies. The author thinks SiGe HBT's will be the miracle device to create multivalue logic. Most high performance bipolar logic is done using ECL/CML type circuits. These circuits can easily be adapted to handle multivalue input levels, which I believe is what the author eluded to. However, these circuits require continuous current to operate, which means very high power. CMOS, on the other hand, assuming a small leakage, only burns significant power during logic transistions. Also bipolar devices are bigger than MOS devices. SiGe HBTs are not the answer for digital logic.

      --
      Vote for Pedro
    3. Re:Power by kdsolutions · · Score: 1

      or a single voltage level with positive, negative, and neutral (no voltage) current for the three states

      --
      Error 666 - Satanic SCO code found in your Linux kernel.
    4. Re:Power by Snorpus · · Score: 1

      But if the logic is set up to be complementary, [-1.5V, 0v, +1.5V] won't, on average, the + and - current paths balance thenselves out?

    5. Re:Power by Anonymous Coward · · Score: 0

      Actually, the really great thing about CMOS is that at any time one of the two complementary (hence _C_MOS) transitors is in a non-conductive state. Thus, as long as the gate is in a stable state ('0' or '1') there is hardly any current flowing and the power consumption is very low. It's only during the transition from one state to the other that there is a "current peak".
      I don't see why it shouldn't be possible to design gates with similar characteristics for ternary logic. You'd just have to switch the output node between three different voltages (e.g. +2V, GND and -2V). Question is: Is it really worth the effort?

    6. Re:Power by overshoot · · Score: 1
      But if the logic is set up to be complementary, [-1.5V, 0v, +1.5V] won't, on average, the + and - current paths balance thenselves out?

      Nope. You could provide a half-rail supply, but the transistors would have to handle the full 3.0 volts and that means they'd be pretty anaemic at 1.5 volts VGS

      Ain't nothin' free.

      --
      Lacking <sarcasm> tags, /. substitutes moderation as "Troll."
    7. Re:Power by ImpTech · · Score: 1

      You could do that... but this is semiconductors, not wires, so I guess you'd have to redesign your basic logic gates to flow that way. I mean, no way is the normal CMOS inverter going to "just work" with negative voltage... all it can do is output high or low. If I recall a negative input would just give you low, or maybe break the thing. So basically the problem is, as my professors always put it, that you'd need to redesign virtually all of your logic circuits, and your various adders and whatnot. We've spent a lot of time and effort over the years making binary operations efficient. That would all have to be done over for multilevel logic. I guess if we get to the point where we cannot under any circumstances make silicon go faster, then it might be worthwhile to try trinary or something like that, but until then the binary guys will just keep getting faster while you're trying to get your trinary gates up to respectable speed.

  19. So, if you flip a coin by civilengineer · · Score: 3, Funny

    you can get either heads, tails, abdomen or heart!

    --

    New year Resolution: Don't change sig this year
    1. Re:So, if you flip a coin by charon_on_acheron · · Score: 1

      Well, when I flipped a coin to your mother, all I got was some head. ;^)

  20. Hey. what about the T-shirts! by arcanumas · · Score: 1
    That's not good. We'd have to change all those T-shirts with binary messages printed in them.

    Not to mention changing the Slashdot Sigs.
    No. For the excelent afformentioned reasons , i vote we stick with binary.

    --
    Slashdot Sig. version 0.1alpha. Use at your own risk.
  21. Research on Multiple-Valued Logic by Anonymous Coward · · Score: 0

    Multiple-valued logic seems to be an fertile area of research judging by the fact that there is an International Symposium on Multiple-Valued Logic.

  22. Pointless by Jonboy+X · · Score: 1

    The "base" of the logic is really a pointless distinction. If you have a computing task you want done, it's just a matter of how to "encode" the task such that the computer can accomplish it, and how efficiently (money- and time-wise) that machine can accomplish that task. Every base is isomorphic (can be represented in) to every other base. I mean, your computer has libraries to print out integers in base 10, even though the internal representation is binary. True and false, and even 0 and 1 are human ideas. Computers deal in voltages.

    --

    "In a 32-bit world, you're a 2-bit user. You've got your own newsgroup, alt.total.loser." -Weird Al
    1. Re:Pointless by Chris+Burke · · Score: 1

      The "base" of the logic is really a pointless distinction.

      Maybe to you. To engineers, it isn't.

      If you have a computing task you want done, it's just a matter of how to "encode" the task such that the computer can accomplish it, and how efficiently (money- and time-wise) that machine can accomplish that task.

      So it's "just" a matter of engineers doing their jobs, eh? But yes, it is a matter of efficiency. Engineers care about efficiency. Engineers know that how you encode data can greatly alter the efficiency of the tasks performed on that data.

      Every base is isomorphic (can be represented in) to every other base. I mean, your computer has libraries to print out integers in base 10, even though the internal representation is binary.

      Yes, anything a binary computer can compute, a trinary one can and vice versa. They're both Turing machines. Anything a computer can compute, a human can, thus making the last sixty years of computing "pointless".

      True and false, and even 0 and 1 are human ideas. Computers deal in voltages.

      That's exactly why this matters. Binary computers deal with two voltages, and trinary computers deal with three. The actual, physical devices are different. So while in the land of theory you haven't at all changed what the computer can do, in the land of reality you've fundamentally changed the way data can be represented and the basic operations that can be performed. That isn't a small thing.

      --

      The enemies of Democracy are
    2. Re:Pointless by solferino · · Score: 1

      Every base is isomorphic (can be represented in) to every other base.



      Bullshit. One third can be represented exactly in a ternary base (i.e. 1 * (3 ^ -1)). Please show me how one third can be exactly represented in a binary base.

  23. Will quarternary cost twice as much as binary? by kaltkalt · · Score: 1

    From a marketing standpoint, that is. Even if they cost the same to manufacture, the fact that they can advertise it as "twice as many bits" (or something dumb like that) will justify a 2x price increase simply because of dumb consumers. Seems like a great marketing gimmick, and maybe nothing more.

    --

    Stupid people make stupid things profitable.
    1. Re:Will quarternary cost twice as much as binary? by Stumbles · · Score: 0
      Lol a marketing gimmick? Given Intel is doing some quick engineering shuffling with their latest processor because 100 watts + on the die has them concerned.

      Ternary data manipulation is noting really all that new. Putting the concept into a CPU is, though IMO the engineering aspect shouldn't be all that unsurmountable.

      I worked on (20 yrs ago) system that used the notion of ternary data for sending commands to satellites. The equipment used then was built when a HP2114 mimi-computer with 8k of core memory was hot to trot. Nevertheless, it worked extremly well. So the idea of 00=0, 01=1, 10=1 and 11=1 quite feasable.

      The real trick will be writting compilers to take full advantage of the configuration.

      To think it won't initially cost more being short-sighted. Any new technology bears such costs. As for dumb customers, sometimes I think computerdom should be like autos. That is you have to pass some sort of test to use them. With the dumb arses that are so unaware they have sobig after billyg made a patch available before it hit, they deserve to pay 2x as much simply for being so ignorant.

      --
      My karma is not a Chameleon.
    2. Re:Will quarternary cost twice as much as binary? by KillerHamster · · Score: 1

      And what would SCO's response be, I wonder?

    3. Re:Will quarternary cost twice as much as binary? by slyxter · · Score: 0

      $1398?

  24. It's not that hard really... by JoeLinux · · Score: 1, Interesting

    It has to do with the decision part of a logic gate. To take an OLD example, in 7400 logic, 3.8V and above is "1", .8 and below is "0", anything else is considered ambiguous.

    All that would have to happen is for a middle range to be established: 2-3V is "2".

    But why stop there? You could have a base10 system by making further divisions. It depends on your ability to differentiate between the various voltage levels.

    You could even have a system wherein a multi-volt circuit checked to see what kind of input it was receiving, and adjusted its decision levels accordingly.

    Back-wards compatible, in other words.

    A tertiary system could get hooked up to a binary hard drive and still have the hard drive work. It would just work like a binary processor.

    hook it up to a base7 operating system, and it adjusts on the fly.

    The only downsides I can see would be that there would be no more bit-"ANDing" or "ORing", etc. It'd be straight math from here on out.

    Also, if you were on a battery system, and your battery levels died slightly, it could mean catastrophe. RF interference could be an issue to.

    Oh well, just my $(2e-2)

    1. Re:It's not that hard really... by JoeBuck · · Score: 2, Informative

      To distinguish between more logic levels, you'd have to increase the voltage level, and power is proportional to the square of voltage.

    2. Re:It's not that hard really... by jjohnson · · Score: 1

      Or improve the stability of the signal, and the sensitivity of your detection gear.

      --
      Anyone who loves or hates any language, platform, or manufacturer, doesn't know what they're talking about.
    3. Re:It's not that hard really... by rcw-home · · Score: 1

      So given Shannon's Law, how can a ternary or quaternary computer be faster?

    4. Re:It's not that hard really... by Anonymous Coward · · Score: 0

      If you're going this far, why not just make an analog computer?

    5. Re:It's not that hard really... by Anonymous Coward · · Score: 0
      But why stop there?

      No reason. You could go all the way to analog computers. But people largely stopped making those for a reason. The same reasons we only use two voltages.

    6. Re:It's not that hard really... by theMightyE · · Score: 1
      To distinguish between more logic levels, you'd have to increase the voltage level, and power is proportional to the square of voltage.

      Or use +V, 0V, -V, where V is whatever voltage you want it to be. Positive and negative signals use the same amount of power, but you've added one more state that consumes energy, so just a 50% increase instead of a factor of V increase.

      On the other hand, most CMOS type transistors (the dominant class of modern high-speed stuff) really only uses significant amounts of power when the gates of the logic circuit change states, so if the system were implemented this way, the power increase would scale more with clock speed than with the number of states.

  25. It's commonly assumed that people are base-10... by puppetman · · Score: 1

    and not binary. We have 10 fingers, 10 toes, etc. We can handle base-10 math easily, but not base-2 math.

    But consider this:

    - there is only one of you, or 2^0
    - you have two parents, or 2^1
    - you have four grandparents, 2^2
    etc, etc.

  26. Zero, One and Many by matfud · · Score: 1

    Them natives are good they count in base three.

    One
    Two
    Many
    Many One
    Many Two
    Many Many
    Many Many One
    etc

    matfud

  27. Survey ... by BabyDave · · Score: 5, Funny

    Do you think three-valued logic is a good idea?

    1. Yes
    2. No
    3. Maybe
    1. Re:Survey ... by sacrilicious · · Score: 1
      Do you think three-valued logic is a good idea?
      • 1. Yes
      • 2. No
      • 3. Maybe

      4. Threesome with Cowboy Neal

      --
      - First they ignore you, then they laugh at you, then ???, then profit.
    2. Re:Survey ... by Anonymous Coward · · Score: 0

      Ternary ISN'T fuzzy though, so that mistake shouldn't be made. It's still a discrete state system.

    3. Re:Survey ... by Aidtopia · · Score: 1

      In a really old April Fool's edition of Byte (or was it Kilobaud, there was a description of the trinary computer. Each trit could be true, false, or who cares?.

      Ah, geek humor.

    4. Re:Survey ... by Angst+Badger · · Score: 1

      Do you think three-valued logic is a good idea? 1. Yes, 2. No, 3. Maybe

      It certainly will make it easier to accommodate ambiguous design specs and non-committal clients.

      --
      Proud member of the Weirdo-American community.
    5. Re:Survey ... by mshiltonj · · Score: 1

      Do you think three-valued logic is a good idea?

      1. Yes
      2. No
      3. Maybe


      It think it would go like this:

      1. Yes
      2. No
      3. PROFIT!

    6. Re:Survey ... by Anonymous Coward · · Score: 0

      Works for boolean and bit database fields.

      True, False, Null
      0, 1, Null

    7. Re:Survey ... by ScottForbes · · Score: 1
      Do you think three-valued logic would be a good idea?

      Wait a minute, this is a Slashdot survey. The choices are:

      1. Yes
      2. No
      3. CowboyNeal
  28. I say bring it on. by torpor · · Score: 2, Interesting

    Then we will never have to check for "NULL" ever again. :)

    Also, I want to work on a computing system wherein *every* single data has its own timestamp.

    I've been experimenting with 64-bit processors in this regard - using regular 32-bits for data, and the remaining 32-bits as a timestamp - and it has produced some interesting results. Treating *all* data as though it has a 'last modified' timestamp...

    If computing systems can be designed to take Time into account with every single operation, it can make for some interesting changes in the programming paradigm ... especially in the realtime world.

    --
    ; -- the corruption of government starts with its secrets. a truly free people keep no secrets. --
    1. Re:I say bring it on. by Anonymous Coward · · Score: 0

      You dont need 64 bits for that. Just use a struct.

    2. Re:I say bring it on. by Stumbles · · Score: 0

      The extra bonus..... plug said machine into a strong Brownian motion device and presto! You have the Heart of Gold.

      --
      My karma is not a Chameleon.
  29. Then I should change right now... by Anonymous Coward · · Score: 0

    Thats an interesting point. My brain is almost wired like that as you suggest. Undergrad was spent getting used to binary. (Now I can even read the slashdot t-shirt that was recently selected as a favorite by Taco with all the binary words showing slashdot.org)

    Now I am a masters student, and I use binary and hex like base 10. I would find it a bit difficult to move to another base right now. But if the move was going to happen, I'd like to start learning this new number system ASAP.

    It is possible to do, I just don't want to do it.

  30. There's no reason to go higher (No advantages) by Anonymous Coward · · Score: 0

    From the article:
    "Shouldn't we also take another look at multi-valued logic?"

    Short answer:
    No. Binary is cheaper (and faster) and you get no real improvement by using more. Not to mention control logic on tri- or quad- would be ugly and complex.

    His point is increasing number density with shrinking transitor structure. When 3 ghz is $250 and 1 gig RAM is $125, where's the problem?

    1. Re:There's no reason to go higher (No advantages) by Zeriel · · Score: 1

      What happens when 3GHz has half the power requirements because of this?

      The cost of the chip means nothing to me. Electricty is the real expense.

      --
      "America has done some terrible things. But I know that Americans don't cheer when innocents die." -Dave Barry
  31. Ternary programming would rock! by Dark+Lord+Seth · · Score: 4, Funny

    #define FALSE 0
    #define TRUE 1
    #define MAYBE 2

    1. Re:Ternary programming would rock! by ehlertjd · · Score: 2, Interesting

      Actually I would think -1 : less than 0 : equal to 1 : greater than Would make sorting interesting.

    2. Re:Ternary programming would rock! by cfallin · · Score: 1

      Actually I would think -1 : less than 0 : equal to 1 : greater than Would make sorting interesting.

      You've reinvented a wheel! C's strcmp (string compare) returns exactly those values.

    3. Re:Ternary programming would rock! by Anonymous Coward · · Score: 0

      I have a better idea:

      #define FALSE 0
      #define TRUE 1
      #define FUCK_YOU 2

    4. Re:Ternary programming would rock! by Anonymous Coward · · Score: 0

      my code in fact looks a lot like that..

      #define FUCK(x) (fprintf(stderr, x), exit(EXIT_FAILURE))

    5. Re:Ternary programming would rock! by Anonymous Coward · · Score: 0

      What, no anti-michael trolling in this post?

    6. Re:Ternary programming would rock! by Anonymous Coward · · Score: 0

      But isn't MAYBE really "true || false" ?
      In which case, it is always TRUE.

      So then, "MAYBE == TRUE" is always TRUE. MAYBE really should be something like "(rand()%2)" for "sometimes true" and "sometimes false"

  32. Connections by maxume · · Score: 1
    Does anybody have any pointers to any advantages offered by trinary or quaternary logic? It would seem that each gate would be able to do more, but it isn't obvious to me how, or what the differences would be. It does seem that if each gate did more, that the computation 'density' could go up, right? And there would be less material devoted to interconnectin everything?

    Clearly, I have no idea what I am talking about.

    --
    Nerd rage is the funniest rage.
  33. Following this to it's logical end by earthforce_1 · · Score: 2, Insightful

    Yields an analog computer. Which is really a digital computer if you count individual electrons...

    Now I am confused.

    --
    My rights don't need management.
  34. This reminds me by denissmith · · Score: 1

    I'm old enough to remember quadrophonic sound.

    --
    I have nothing to hide. So, why are you spying on me?
  35. Re: But you're partially onto something... by op51n · · Score: 1

    I was wondering while reading this, doesn't it kind of ignore the fact that some of the biggest breakthroughs are more likely to come from things like quantum computing, or even the DNA based processing techniques?
    It strikes me, that to make a statement like "Or will Moore's law continue without the need for doing more with less silica based real estate?", after the article really is just pushing out the other, to me, more likely, possibilities, to make this an important article?
    I'm not saying it's not, and that discussing this won't have advantages, but let's not forget all the other things being discussed.

  36. True, false, Sorta true, Sorta false by The+Clockwork+Troll · · Score: 0, Redundant
    So now there would be:

    • True
    • False
    • Sorta true
    • Sorta false
    I don't believe it - is this a case where politics has beaten science in advancing the state of the art?
    --

    There are no karma whores, only moderation johns
  37. Two big problems by Anonymous Coward · · Score: 0

    It will be harder to program for. Say bye to hexidecimal, its 27-imal (is there a name for it?). It would be 0-9a-k, brain melting! And to factor with the powers of three, the tribyte would probably be 6-trits (trinary digit), which would represent a value of 729.

    Binary compatiblity. Not just for applications, but for data. Sure you would be able to compile applications from source for your tri-athlon, but would it beable to read your binary documents?

  38. Stop that! by HookedOnPhonics · · Score: 0, Insightful

    There is no such word as "definate"!!! You did it more than once, and it's so fucking irritating! What the fuck is wrong with you people? Why do so many of you assholes make that same damned mistake?

    Obviously, you aren't a total fucking moron and you can spell most words (even uncommon ones). So, why the fuck can't you spell this one? Just think about it... definite, as in defined, as in not infinite. Clearly, you are just using the word, with no comprehension of how the word came to be or its relationship to other words (do you even know what it means?), otherwise the spelling would be glaringly-fucking-obvious.

    --


    You fucking idiot!!!
    1. Re:Stop that! by Anonymous Coward · · Score: 0

      I'm with you 99%.

  39. For the love of god by Timesprout · · Score: 2, Funny

    will someone please think of the dialogs we will have to implement for this extended logic.

    There will be no more

    Yes No Cancel

    Now it will be

    Yes No Maybe Cancel

    Yes No Maybe Dont_Know Cancel

    Yes No Yes(but I mean no) No (but I mean yes) Maybe Cancel......

    --
    Do not try to read the dupe, thats impossible. Instead, only try to realize the truth
    What truth?
    There is no dupe
  40. This will only be faster... by Bridog · · Score: 1

    ... if the transition time is reasonably fast. Consider how long it takes a transistor to switch on-board; this (not is but) determines when the CPU is ready to send the result of a calculation. It would seem to me that the more graduations you introduce into your 5V, the longer you'll have to wait, due to transition and bouncing. With this in mind, tertiary seems reasonable, but `base 10' or higher seems questionable.

    --
    Most likely the #1 Unfunny Meta/Moderator on /.!
  41. Binary logic by OneIsNotPrime · · Score: 3, Interesting
    Actually yes, Boolean functions such as AND, OR, etc., typically accept binary input, but logic tables can be created for functions with ternary (or quarternary, etc.) input.

    It's hard to break out of binary thought since the traditional AND/OR in computer science mimic the English language usage of these terms, but in reality one could create any logic table and assign it a name. The fact that AND/OR have clear English meanings confuses the issue when we try to apply them to ternary input; we might as well call the functions FuncA, FuncB, etc. and define the logic tables arbitrarily, then pick those which are commonly useful and give them more definitive names.

    Note that the size of a logic table increases geometrically with the number of possible values of each input. 8 bits have 256 possible values, but a group of ternary transistors has 6561 possible values, and quarternary would have 65536. As you can see, this number explodes very quickly. Hence, making such transistors would allow chip makers to make huge strides in speed without having to handle the engineering problem of packing in more transistors.

    --

    ---

    WARNING:Slashdot karma not redeemable in the afterlife.

    1. Re:Binary logic by maraist · · Score: 4, Informative

      Hence, making such transistors would allow chip makers to make huge strides in speed without having to handle the engineering problem of packing in more transistors.

      No, they'd just trade the engineering problem of packing more bits into once space with finding ways of unambiguously interpreting a value.

      See the whole power of binary (pardon the pun) has always been it's wonderful noise-suppression ability. Imagine a copper wire running 2 miles with either a 5V or a 0V signal on it. You can apply a simple analog device (say a BJT transistor amplifier) that utilizes an exponential function switching at some precisely known voltage (we'll call it 2.5Volts). Voltages before and beneath this voltage are amplified to either zero or 5V exponentially, such that only voltages within a small delta of the threshold voltage have any ambiguity.

      Thus you can determine the likelyhood of noise on a line, then put digital amplifiers every so often such that no amount of noise will be sufficient to raise or lower the voltage to the ambiguous region.

      The same is true even on micro-scopic wires; Fanning transistor outputs out to too many transistor inputs introduces noise on the wire. CPU's not surprisingly utilize "buffers" which are trivial 2 transistor logic gates which pass the output to the input. This cleans the signal just as the higher-powered digital amplifiers do.

      While I'm not sure which particular technologies are being considered in this trinary/quatrinary logic system, if it is nothing more than a sub-division of voltages, then it's doomed to failure for general processing, and possibly even simple memory storage. First of all, you introduce another whole region of voltage ambiguity. The only way to maintain your safety zone is to up the voltage or provide more amplification stages to garuntee a cleaner signal. But the trend has been to decrease, not increase voltages (lower power consumption, smaller devices, whatever), and adding additional logical devices merely to interpret a signal means that your bit-density is going to suffer.. Exactly impeeding it's whole point.

      Likewise for denser bit-storage, since the probability of bit-error necessarily increases (all else being equal), then you're not as likely to achieve as small or as dense a physical digit. So unless you can at least achieve less than 1.5x logical-digit spacial expansion (due to error-compensating material), you haven't gained anything by going to a trinary system.

      Lastly, the concept of >2 digit computing already has a particular niche where it's trade-offs are acceptible.. Think of 56k modems which encorporate dozens of thousands of "values" for a single digit. They utilize a full 256 voltages for each anticipated time-slice. Of course the analog modem can't anticipate the exact sampling point where the analog phone line gets digitized (happening to transition at that point can be bad), and there is usually a tremendous amount of line noise. But what modems wind up having to do is group several time-slices together and produce a macro-digit with a but-load of error-correcting pad-values. And that's not even enough; the entire packet is still likely to have misrepresented digits, so CRCing and thereby retransmission is often necessary.

      All this effort is worth it because we physically realize extra bandwidth.. But such a "probabalistic" solution (prone to bit-error) is unacceptable at the lowest level of computation. You can't get any less error prone than binary (given the above discussion), and mathmeticians have shown that base-e (2.717) is the optimal number to balance complexity of the number of combinations with the number of digits in a given number. (analogously demonstrated by considering an automated phone system where you have to wait to hear 10 possible choices per menu (the base-10), and you have to go through k menu levels to achieve what you want. The metric is the average wait-time using different bases, and mathmatically the shortest wait time was the

      --
      -Michael
    2. Re:Binary logic by Anonymous Coward · · Score: 0
      adding additional logical devices merely to interpret a signal means that your bit-density is going to suffer.. Exactly impeeding it's whole point.

      ha, ha...(s)he said "impeeding"

      (and "it's")
    3. Re:Binary logic by The_Laughing_God · · Score: 4, Interesting
      While higher-base number systems might have "special case" uses someday, it's important to understand that they are mere steps on the continuum to analog. This trivial seeming fact has some surprising consequences.

      Binary, being the lowest base that can represent any integer mathematics, is not a point on the continuum, it is a defining terminus of the continuum, and has many special properties. Termini (endpoints) often do, especially in one-ended ranges (e.g. base two is the lowest number of sates, but in theory analog has an infinite number of states, and any real-world instantiation of an analog computer can only be an approximation.) One example of an open-ended range where the sole endpoint has unique properties is the prime numbers (which, properly, must be positive integers): the lowest prime, 2, has so many unusual properties that it is often excluded or dealt with as a special case. it is believed (but not quite proven) that there is no highest prime

      This may sound trivial or like mealy-mouthed gibberish, so here's an example:
      In every multi-state binary-like computer, division is computationally 'harder' than multiplication except base two!

      Any algorithm for general division (by an arbitary divisor) involve more multiplications (and then subtractions, according to the results of implicit trial and error subtraction [branchpoints]) than a corresponding extended ('long form') multiplication. The reason this does not occur in base two is that multiplications by the two binary digits 1 and zero is so trivial that it does not need to actually be performed - a compare and branch suffices, which corresponds to the compare and branch preceding the additions of a binary multiplication.

      This is pretty special. While multiplication and division are inverse function, full generalized division is always 'harder' than generalized multiplication. This is quite unlike, say, subtraction, where a 'subtraction circuit' can be constructed to perform subtraction exactly as easily and in roughly the same number of, say, transistors as an adder.

      Binary math has many special properties in group and number theory. We'd lose those in higher base math, and we wouldn't gain new properties to make up for that loss. Two, the low bound, is special.

    4. Re:Binary logic by OneIsNotPrime · · Score: 1
      You make a lot of interesting points, (particularly about ternary being a step on the road to analog - Moderators, please mod him up for that if you don't see it anywhere else in this thread) but I disagree with a couple of things.
      It is believed (but not quite proven) that there is no highest prime.

      Actually it is well proven that there are an infinite number of primes. Here is a really straightforward, simple proof.

      Binary math has many special properties in group and number theory. We'd lose those in higher base math, and we wouldn't gain new properties to make up for that loss. Two, the low bound, is special.

      Not sure what you mean here. Yes, groups of order 2 have some special properties, but so do groups of various prime and square orders etc. '2' is indeed a special prime, being the smallest absolutely, but that doesn't give it a monopoly on having special properties. See Here for some more resources on prime numbers (OK, now I really sounds like a geek.)

      --

      ---

      WARNING:Slashdot karma not redeemable in the afterlife.

    5. Re:Binary logic by Anonymous Coward · · Score: 0

      Euler's constant, e, isn't 2.717 but rather (truncated to as many digits) it's 2.71828459045

      Other than that, sounds good :)

    6. Re:Binary logic by Thuktun · · Score: 1

      it is believed (but not quite proven) that there is no highest prime

      I'm puzzled that you've not seen the proof of this, since it's been around since 300 BC or so.

  42. Been there, done that by MycroftMkIV · · Score: 1

    The very first computer I ever programmed was a base-10 IBM 1620 (in California, 1968). If IBM didn't see enough business for a non-binary machine, why will anyone else?

    Of course in those days, the machine was incredibly primitive. It didn't even know how to multiply without help. But it did run Fortran II very slowly and well.

    1. Re:Been there, done that by Anonymous Coward · · Score: 0

      Ah yes, the 1620. I still remember the boot sequence:

      34 00032 00701 36 00032 00702 49 02402 1119636113 00102

      Memories...

      ObTrinary: I always thought it would be interesting to change the interpretation of the three states to "pleasure," "pain" and "neutral" and then figure out opcodes which essentially implement logic that moves toward pleasure and away from pain, using neutral states as needed. Wasn't ever able to really wrap my brain around this enough to posit a working theory, sadly.

  43. Noise Margin by reporter · · Score: 4, Insightful
    When the voltage for digital circuits back in 1970 ranged from 0 volt to 5 volts, there was talk about using, say, a base-3 number system. Imagine how this system might be implemented. Digit 0 would be [0, 1.67) volts. Digit 1 would be (1.67, 3.33) volts. Digit 2 would be (3.33, 5.0] volts.

    Now, for a binary number system, digit 0 is [0, 2.5) volts, and digit 1 is (2.5, 5] volts. Clearly, the noise margin of the binary number system is much better than the noise margin of the base-3 number system.

    Now consider the voltages of modern digital circuits. Consider a voltage range of [0, 1.5] volts. In a base-3 number systm, digit 0 would be [0, 0.5) volt. Digit 1 would be (0.5, 1.0) volt, and digit 2 would be (1.0, 1.5] volts.

    For a binary number system, digit 0 is [0, 0.75) volt, and digit 1 is (0.75, 1.0] volt. Again, the noise margin of the binary number system is much better than the noise margin of the base-3 number system.

    In fact, the noise margin of the binary number system is consistently 50% better than the noise margin of the base-3 number system. The noise margin of the binary number system is always better than the noise margin of the base-n number system, where n > 2. For this reason, engineers have not built and will not build digital systems with any non-binary number system.

    1. Re:Noise Margin by be-fan · · Score: 3, Informative

      However, look at it this way. The voltage differentials were able to drop from 2.5 volts to 0.75 volts (actually, even less than that inside modern microprocessors) because circuits got that much better at overcoming noise and detecting precise voltages. If you can detect a differential of 0.5 volts that you can go ternary without bothering about noise.

      Besides, you're wrong. People have built digital systems with non-binary number systems. There are flash memory chips that use a 4-level voltage scheme to increase data capacity.

      --
      A deep unwavering belief is a sure sign you're missing something...
    2. Re:Noise Margin by Snorpus · · Score: 1

      But the noise margin of a 3-state [-1.5, 0, +1.5] volt system is the same as a 2-state [0, +1.5] system. The hardware cost in the P/S would be minimal, vanishing to zero over time.

      We would need to change nothing about the way we code; at the highest, the changes would occur at compiler output level.

      Hardware designers, on the other hand, would be in for a whole new world.

      Representing trinary digits on magnetic or optical media, OTOH, might be quite a challenge.

    3. Re:Noise Margin by digital+bath · · Score: 1

      Could cd's use the same logic? scatter the beam = 0, scatter half the beam=1, bounce the whole beam back=2?

      --
      find / -name "*.sig" | xargs rm
    4. Re:Noise Margin by teakillsnoopy · · Score: 1

      In fact, the noise margin of the binary number system is consistently 50% better than the noise margin of the base-3 number system.

      Consistently? From what I remember, half of something is
      ALWAYS 50% more than a third of the same thing.
      So much fancy language to state something so obvious.
      The more levels of logic you have the less room between the levels.

    5. Re:Noise Margin by Snorpus · · Score: 1

      I don't know enough about how CD's work to intelligently comment on your question, but I will anyway, in the true /. tradition.

      My understanding of optical disks is that they use the amount of reflectivity to determine the 1's and 0's. [I could be wrong about that.]

      I could envision a CD system where some baseline reflectivity value is determined to represent 0... less than that would mean -1 and greater than that +1, thus giving us our trinary system.

      Backwards compatibility could even be maintained in Trinary-CD drives by have the drive scan the disk upon loading, and take a "guess" as to its type.

      Lets assume that reflectivity ranges from 0 to 1000. A drive could scan the disk upon loading... if if sees primarily 0 and 1000 reflectivity values, it assumes it's a binary CD/DVD... if it sees roughly equal 0-500-1000 reflectivity values, it assumes the disk is a tri-value CD/DVD.

      And the intelligent drive of the future would allow the user to override the automatic detection, if she knew the disk was of a specific type.

    6. Re:Noise Margin by silas_moeckel · · Score: 1

      Now your talking about making a wholy new and incompatable medium (backwards at least) It would make more sence and save everybody headaches to just encode things from 3 trinary symbols to 3 binary symbols. Base anything can be easily converted to base 2 and back. The only place a new method of storing date would be needed would be memory due to the added latency of conversion.

      Beyond that space is space Flash is using a Quad endoding method because of effeciency to encode binary data it's not complicated at all to do remember you have to end on a 512 byte alignment anyway so they just have 256 symbols to do the same thing. Especialy in mordern flash you realy dont talk to the core anymore between different encoding methods and methods to make them wear evenly. With everything but RAM access latency isnt in the same scale and a little logic to encode and decode wouldent be noticed (actualy a Trinary or above encoding would increase density and thus speed for rotational media)

      --
      No sir I dont like it.
    7. Re:Noise Margin by x42 · · Score: 1

      optical computing now !!!
      photons can have very well distinguishable different polarization states.
      we are used to thing about computer-bit-logic in different electrically well-defined standards - ttl being just one possibility.
      with photons we have possibilities to deal with logic independently of voltage levels.
      (there are also other possible implementations)

    8. Re:Noise Margin by Anonymous Coward · · Score: 0

      Maybe you should take a look at network data transfer at the electrical level. You might just discover that you are wrong about what engineers will do and have done.

      BTW, standard tristate logic circuits generally have on, off and high-impedance as their three states.

      What you have suggested is more in the realm of fuzzy logic circuitry.

    9. Re:Noise Margin by hughk · · Score: 1

      Interestingly, neurons work using FM. Biological wiring is incredibly noisy (ion transport) and the solution that has evolved involves modulating the pulse frequency. This seems to give rise to much more compact (and resiliant) circuitry than either binary or multi-level logic.

      --
      See my journal, I write things there
  44. Buddhist Four Fold Logic vs Aristotlean Binary by Anonymous Coward · · Score: 0

    Aristotle, given x & y:

    1) x
    2) y

    Buddhist, given x & y:

    1) x
    2) y
    3) x & y
    4) ^(x & y)

  45. I don't think so by The-Pheon · · Score: 1

    In Moore's own words

    No exponential is forever, but we can delay 'Forever'

  46. Engineering gain or loss? by flend · · Score: 2, Insightful

    The nice thing about binary systems are that they are either on or off. As gates and tracks get smaller, interference effects etc. become the limiting factor.

    As we add more states, intermediate voltages, to the system, the difference between states becomes smaller, ie. the difference between states 2 and 3 in a ternary system is less than states 1 and 2 in a binary system.

    Hence a binary system can be made smaller and denser than a ternary system and still work.

    We may gain in logic density but lose out in physical density.

    1. Re:Engineering gain or loss? by Snorpus · · Score: 1

      Which then becomes a design issue... at the current State of the Art, which is better?

      At the future state of the art, which will be better?

      Binary became dominant from the early days of computing, because it was easy to slam a lot of current into the grid of a vacuum tube, and cause the plate circuit to saturate (conduct maximum current). The plate voltage would drop to near zero, and we'll arbitrarily call this Logic 0 (False).

      If we inject no electrons into the grid of the vacuum tube, no current will be conducted in the plate circuit, and the plate voltage will be near the power supply level. We'll call this Logic 1 (True)

      This, basically, is how Marconi's trans-Oceanic transmitter worked in 1903 (or was 1903 when the Wright Brothers flew?), and it's bascially how digital circuitry works today.

      With todays technology, maybe it's true that a 3-state CPU might only achieve the performance of 10, 15, or 20 years ago.

      Just remember that the first IBM PC of 30 years ago came with 16KB (that's Kilobytes) of memory.

  47. various reasons? like physics? by en_0ne · · Score: 2, Insightful

    >Non base two computing is nothing new. But it is an
    >idea that, for various reasons, never really caught on.

    The various reasons not being so various; A binary system can be constructed in a much more stable fashion than can a trinary or quatrinary system. Everyone knows that 1 is not always exactly 5v (or 3v). Having several values confuses the picture even more

    "but we have progressed enough that trinary systems are much more stable now!"

    No matter what level of stability someone can get out of a trinaty or quatrinary system, a binary system will always be able to be more stable.

    'ON', 'OFF' will *always* be superior to 'ON', 'KINDA ON', 'KINDA OFF', 'OFF'

    1. Re:various reasons? like physics? by aXis100 · · Score: 2, Insightful

      You're still thinking binary. What about

      * Red, Green and Blue
      * Apples, lemons and bananas

      All unique, easily identifiable, only one step between them. No intermediate transition required. Now, we just have use an electronic equivalent.

  48. What would the benefit be? by Grendol · · Score: 1

    What would the benefit(s?) be of going to such a system?

  49. Tertiary Truth Tree by Sumbody · · Score: 1


    How about this, same AND:
    a b ?
    - - -
    0 0 0
    0 1 0
    0 2 0
    1 0 0
    1 1 1
    1 2 1
    2 1 1
    2 2 2

    OR would be harder, and more so to interpret what the hell it actually means:

    a b ?
    - - -
    0 0 0
    0 1 1
    0 2 1
    1 0 1
    1 1 2 (---====== Here I assumed OR would be a higher value if both non-zero values - the "Bonus Plan" (for no apparent reason.)
    1 2 2
    2 1 2
    2 2 2

    My head hurts.

    1. Re:Tertiary Truth Tree by cybergibbons · · Score: 1

      Forget thinking about the logic behind it - just try saying "Tertiary Truth Tree" quickly...

  50. Just base 3 or 4? How about base pi, e, i, 1,... by dwheeler · · Score: 4, Interesting

    Base 2,3,4, and 10 are so easy. If you really want a challenge, build a computer using base pi, e, i, 1, or 0 :-).

    --
    - David A. Wheeler (see my Secure Programming HOWTO)
  51. I say.. by Anonymous Coward · · Score: 0

    01010110011010010111011001100001001000000110110001 10000100100000010000100110100101101110011000010111 00100111100100100001

    (Viva La Binary!)

  52. Obligatory Futurama Reference by soft_guy · · Score: 1

    "It was only a dream. There's no such thing as 2."

    - Phillip J. Fry

    --
    Avoid Missing Ball for High Score
  53. Had to say it by Anonymous Coward · · Score: 0

    ...prove we will be using a quaternary system. How many gigaquads of hard drive storage do we need, anyway?

    640 kiloquad ought to be enough for everybody.

  54. Excise decimal first. by Thinkit3 · · Score: 1

    We don't even use base two (or the shorthand base sixteen).

    --
    -Libertarian secular transhumanist
  55. Moores Law changed ??? by w42w42 · · Score: 1

    I may be wrong, but hasn't most of the effect of moores law existed based on improvements in chip design and manufacturing alone - ie. the doubling of transisters on a chip or the doubling of clock speed of a die.

    If we were to double the clock speed or transisters of a tirnary computer, would that still give just a 2x performance increase, 8x, or somewhere in between? I can't even get my head around this enough to begin ...

  56. Something I used to smirk at in CS 101 by Catbeller · · Score: 1

    Back in the day, as I taught myself the basics of binary arithmetic and logic gates, it amused me to think about how most of the esoteric training for programming involved thinking in two digits.

    I imagined that if a stable 10-state device could exist, programming would no longer need a mathematical priesthood.

    I now think in my old age that someday a stable 10-state device will come. And it will be received with all the joy of wedding guests greeting a police raid. If you take the hex out of coding, how will the elite keep out the hoi polloi?

    It's not that simple, :) of course, but a lot of the arcana of programming stems from base 2.

    It'll never happen, base10 computing, not in our lifetimes. But it is amusing to think of the unwashed masses waking up one day to realize that coding wasn't that hard after all...

  57. Re:It's commonly assumed that people are base-10.. by thebatlab · · Score: 1

    Actually I have 3 grandparents, 3 parents and if there's only one of me.....who the hell keeps telling me to light things on fire?

  58. Here, here! by jemenake · · Score: 4, Funny

    Well, if the word "bit" is a contraction of "binary digit", then I'm all for a move to "ternary digits". We need a lot more of those in this field.

    1. Re:Here, here! by Intocabile · · Score: 2, Funny

      You have seen a programmer before haven't you?

    2. Re:Here, here! by Atilla · · Score: 1

      oh yeah... i was wondering about the naming scheme. would it be bits, tits, quats, quints, etc?

      heh, 10-base would be dits :)

      --
      --- sig moved for great justice.
    3. Re:Here, here! by Anonymous Coward · · Score: 0

      heh, 10-base would be dits :)

      And 0-base would naturally be... (nah, too easy).

      As for an infinity-based numbering scheme, that would belong to us.

    4. Re:Here, here! by corkhead0 · · Score: 0

      That was hilarious, welcome to the friends list :)

  59. Right.... by mindstrm · · Score: 1

    Yes, computers deal in voltages, but only two voltages. The logic we design in those computers, at the lowest, fundamental level, is based on a decision of whether any individual signal is at one voltage, or another. There is no third state.

    The idea is that if we work in ternary, or other multi voltage based system, (which implies we need the math and logic to design the system around), we can get more processing done with the same amount of silicon.

    The base of the logic is not pointless at all.. the binary logic we talk about is *exactly* what the computer uses at the lowest level, each individual component is deisgned to work around a binary system. Moving to another system means different components... it is by no means arbitrary.

  60. Decimal causes cancer by Thinkit3 · · Score: 1

    Those who don't understand binary don't deserve to live, right?

    --
    -Libertarian secular transhumanist
  61. Balanced Ternary, and Ternary circuits by Sparr0 · · Score: 5, Interesting

    One of the best parts of Ternary (Trinary, base 3) is that you can use BALANCED Ternary, in which the digits are not 0, 1, and 2, but are -1, 0, and 1. This allows you to represent any integer without a sign bit. Letting N represent -1 digit you can represent -17 in balanced ternary as 101N (1*(3^0),0*(3^1),1*(3^2),N*(3^3)).

    You can check out http://www.trinary.cc/Tutorial/Tutorial.htm for many examples of ternary circuits using ternary logic gates.

  62. blah by luckyguesser · · Score: 0, Redundant

    01010111011010000110000101110100001000000110110101 10000101101011011001010111001100100000011110010110 11110111010100100000011101000110100001101001011011 10011010110010000001100010011000010111001101100101 00100000001100110010000001101001011100110010000001 10010101100001011100110110100101100101011100100011 1111

    --


    The power of Christ compiles you.
    A Random Blog
  63. Problems with creating a 3 or more stable states by stickman19 · · Score: 2, Informative

    Theres one small problem with this is that anyone who knows basic physics and logic design circuits that operate on voltage base would be impossible as you can not creat instantainious changes in voltage as it violates basic physical laws of capacitance (as the capacitance across 2 devices is = to 1/2 the capacitance multiplyed by the voltage squared and the only way for there to be an instantaious change across the 2 would be for there to be and infinite power supply). The only way in order to create a system with more then 2 stable states would be to use a different method for measurement such as measureing changes by useing lightbeams.

  64. Re:It's commonly assumed that people are base-10.. by EverDense · · Score: 2, Funny

    - you have four grandparents, 2^2

    Only if I dig them up.

    --
    http://jesus.everdense.com/
  65. If we have tri-states.... by 91degrees · · Score: 1

    Why not abolish a different area - synchronous computing.

    Rather than considering them to be 3 valid values, we simply have invalid, 0 and 1, and if any of the inputs are invalid, the output is invalid. The value isn't propogated until all the inputs are valid.

  66. Sign Bit by Baron_Yam · · Score: 1

    Actually, you'd probably still have a sign tit... -1 for negative, +1 for positive, and 0 for imaginary.

    Hehehehe... I said, 'tit'.

    1. Re:Sign Bit by Anonymous Coward · · Score: 0

      what about negative imaginary?

  67. Does this mean??? by sumho · · Score: 1

    i can finally run my java/swing programs at the speed of native programs??????

    --
    All it takes to fly is to hurl yourself at the ground... and miss. -Douglas Adams
  68. E-mail I wrote a long time ago about trinary by b0rken · · Score: 2, Insightful

    Date: Wed, 26 Dec 2001 10:38:34 -0600
    From: Jeff Epler
    To: steve@trinary.cc
    Subject: Trinary adder efficiency
    Do you know of any more efficient trinary adder designs? I've found an
    online abstract of a paper that may have some, but I don't have access
    to the paper itself:
    http://www.computer.org/proceedings/ats/7129/71290 387abs.htm
    Also, do you know if a "balanced trinary" adder (-1, 0, 1 trit values)
    is any simpler than your trinary (0, 1, 2) adder?

    I also performed a simplistic comparison of the proposed full adder on
    your website against a binary full adder at
    http://www.play-hookey.com/digital/adder.html
    I compared number of gates and number of gate delays for a 64 bit binary
    adder and a 40 trit (slightly smaller range than 64 bits) trinary adder
    designed from each full adder. These aren't open-and-shut cases, since
    they don't answer questions such as the relative size and speed of
    trinary gates to binary gates in a particular process, but I think they
    may raise some interesting questions about circuit design than the
    proposed "minimize m*n for given m^n" measure.

    In your adder, I count 17 gates + 3 muxes at 15 gates each for 47 gates
    per trit, or 1880 gates for a 40-trit adder. I count 5 gates per bit,
    or 320 gates for a 64-bit adder in the binary case. Thus, at least
    in adders for numbers in this range seem to be significantly larger
    for trinary. (won't this advantage always exist as a constant factor?)

    In your adder, I count 7 gate delays for the MUX operation, giving a
    count of 14 gate delays for the "result" path and 11 gate delays for the
    "carry" path. In the binary full adder, I count 2 and 3 delays for
    the paths. This gives 443 gate delays for the trinary adder, and 191
    gate delays for the binary adder. (again, won't this advantage exist for
    numbers of any magnitude with the same constant factor?)

    By either of these measures, it's hard to see trinary logic as a "win".
    I haven't investigated more complex adder designs (carry-lookahead adder
    and its trinary counterpart, if any) or more complex ALU operations
    (multiplication/division, floating point) to see if the advantage binary
    shows here exists in other operations as well.

    If the real "win" of trinary is in external pin-count, then another good
    option would seem to be to use trinary (or even 4-state) logic for
    I/O, and convert to binary before entering the main logic of the chip.
    4-state logic would have easy binary conversion, and if trinary inputs
    were chosen, encodings such as 6t->9b, 7t->11b, 9t->14b, 12t->19b (#
    trits -> # bits) could be chosen. (You need 3**n to be just larger than
    2**m, where you can also build efficient converters for that width
    number)

    One last thought -- when we convert all our old COBOL programs from
    binary computers to trinary ones, we'll have to face the horrible
    encoding "TCD", where each decimal digit will require three trits.
    Thus, numbers up to one million would require 18 trits, compared to 24
    bits. Using the 'm*n' measure, the bits solution wins (24*8 = 48
    18*3 = 54)

    Thanks for taking the time to read this far -- if you've addressed these
    points on your website, I hope you'll let me know where (I read much of
    it, but not the whole thing by any means).. thanks for the interesting
    website, and I hope you're not drowning in messages after the recent
    magazine article and publicity on a certain geek website...

    Jeff

    --
    Hate stupid software on freshmeat? Laugh at
    1. Re:E-mail I wrote a long time ago about trinary by Anonymous Coward · · Score: 0

      ...and I'm sure he's really happy you posted his unmunged email address on one of the most scraped sites on the web...

    2. Re:E-mail I wrote a long time ago about trinary by b0rken · · Score: 1

      Do you want mine too? jepler@unpythonic.net

      Anyway, he already has his e-mail address in non-munged form in the internet (http://www.trinary.cc/Projects/Projects.htm).

      If I had it to do over again, I might have munged or removed the address, but I didn't think about it. I don't munge my e-mail address when I post to various mailing lists and newsgroups, and I generally decline to correspond with people who munge or use TMDA-style services. It's just not part of my mindset to munge or put an onus on the sender (who may, after all, be contacting me to help me for free with something I posted about!).

      Anyway, I'm not sure how that morphed into a SPAM rant. I'm mostly asking forgiveness for this mistake, and an explanation of why it wasn't even on my mind...

      One last question -- what makes you say that /. is "one of the most scraped [by spammers -J] sites on the web"? Surely there are easier marks for the spammers to select than us! ebay, yahoo, AOL are bound to be better choices, at least in terms of sales per million messages.

      --
      Hate stupid software on freshmeat? Laugh at
  69. Go for the Ultimate Matrix! by axxackall · · Score: 1
    The point is not to look for benefits of information presentation. I agree, 1 byte (= 8 combinations) can be encoded either by 8 binary-stated wires or by 8 states of the single wire.

    The point is that after the density of wires will come closer to its limits, then the amount of states per wire can increase the informational density, making devices more compact. It will not come without a price: you'll have to have more precise "readers" that can read more states (levels?) per wire. I think it will certainly useful to increase the density of memory devices.

    Today the race is directed to increase amount of wires: 16-, 32-, 64-bit architectures, what's next? Tomorrow they may split the density between amount of wires and amount of levels. However, I am wondering, what can we expcet in a really far future? Infinite amount of wires or infinite amount of levels? Or both?

    Inifinit amount of wires with infinite amount of levels means just an electromagnetic field, IMHO. So, the dynamic and the shape of the field means the computation. Wow! That's something cool! Wait a minute, it's not new.

    I remember reading a hardprinted article 20 years ago (back in Russia) about a generalization of neural networks. In that article the author is taking a typical math model of a neural network and makes neural elements extremely small (infinitely), while amount of them extremely big (also infinitely), while keeping analog signal (means no fixed levels, or infinite amount of levels) between them. The result of such generalization after several transformations was just a system of equations of Maxwell, desribing the most general electromagnetic field. It means that the whole electromagnetic field of the Universe is the most ultimate neural-network simulator with all (and also ultimate!) self-learning capabilities. I wonder, what would take to include there other fields as well?

    Conclusion: the ultimate comuputer (and equally same way the ultimate brain) is the Universe itself. Hmm... Sounds like a super-mega-Matrix again - the Universe that is the program that interprete itself... Enough for today - I need a rest or I'll start to interprete myself recursively :)

    --

    Less is more !
    1. Re:Go for the Ultimate Matrix! by EddWo · · Score: 1

      8 bits = 256 Combinations
      3 bits = 8 Combinations

      64s 8s 1s
      3 7 7 = 255

      You need 3, 8-Stated wires to represent 1 Byte
      That can actually produce 512 combinations.

      --
      "Taligent is still pure vapor. Maybe they'll be the last who jumps up on Openstep... "
  70. Coverage by Trinition · · Score: 1

    Haven't we covered this before?

    I also read a paper once explaining how 3 was the optimal number base when you consider the number of different symbols needed and the width of a string of those symbols needed to represent numbers. I even solved the equations myself coming to this conclusion. You actually find "e" (2.718281828...) as your answer, but the closest whole number is 3, not 2.

    Unfortunately, I don't have a link and Google has failed me :-(

  71. Perfect for women by marvin2k · · Score: 5, Funny

    The quaternary system would be perfectly suited for women:

    0 = No
    1 = Yes
    2 = No (But I mean yes)
    3 = Yes (But I mean no)

    1. Re:Perfect for women by Ziviyr · · Score: 1

      Looks like you just took an average boolean value and tacked on a bullshit bit.

      Sounds like you're stuck in AND $02 mode.

      --

      Someone set us up the bomb, so shine we are!
    2. Re:Perfect for women by Tablizer · · Score: 1

      0 = No 1 = Yes 2 = No (But I mean yes) 3 = Yes (But I mean no)

      Sounds like the OS that Kobe Bryant was using that fateful night.

    3. Re:Perfect for women by sbszine · · Score: 1

      Swish!

      --

      Vino, gyno, and techno -Bruce Sterling

    4. Re:Perfect for women by bobbozzo · · Score: 1

      But what about the
      null = "I'm waiting for you to read my mind"
      state?

      --
      Nothing to see here; Move along.
  72. Transistors too small. by Anonymous Coward · · Score: 0

    It seems like just yesterday that /. had a posting about transistors getting so small that chips had to be designed such that each gate had a "probability" that it was going to work up to spec. (As in it would be lucky if it was actually binary...forget about some fancy 3 or more states.)

    For a long time now, there have been telephone answering machines that use flash chips to record multi-level "analogue-bits"!
    It works but it is not exacly CD quality (all digital) sound.

  73. Correction by b0rken · · Score: 1

    >Using the 'm*n' measure, the bits solution wins (24*8 = 48 18*3 = 54)

    Should be 24*2 = 48

    --
    Hate stupid software on freshmeat? Laugh at
    1. Re:Correction by Mr+Z · · Score: 1

      XOR is addition on each digit modulo the number base. Another way to think of it is as "Add without carries."

      Thus, in tertiary logic, the truth table would be: (X = A XOR B)

      A B X
      - - -
      0 0 0
      0 1 1
      0 2 2
      1 0 1
      1 1 2
      1 2 0
      2 0 2
      2 1 0
      2 2 1

      I use the "modulo-ADD" aspect of XOR when implementing finite-field arithmetic. CRCs, Reed-Solomon codes, etc. all use finite fields (or more likely, the special case of finite fields called Galois fields). Do a Google Search to learn more.

      --Joe
  74. DNA Computing by VisorGuy · · Score: 1

    Would/could DNA Computing be inherently base-4?

    --
    This user account is inactive account replaced by the PDA
  75. Im gonna get innto trouble by NanoGator · · Score: 1

    Men = Binary Logic.
    Women = Fuzzy Logic.

    Me = Sleepin on the Couch.

    --
    "Derp de derp."
  76. Re:Survey (Zen & the Art of Motorcycle Mainte by Corporate+Drone · · Score: 1
    Or, for those of you who've read Pirsig's "Zen and the Art of Motorcycle Maintenance",

    1. Yes

    2. No

    3. Mu

    --
    mmm... yeah... You see, we're putting the cover sheets on all TPS reports now before they go out...
  77. From a trinary computing tutorial... by Jerk+City+Troll · · Score: 2, Funny

    Another poster provided trinary computing tutorial. On one of the pages for the introduction, the author writes:

    The basis for understanding Trinary Algebra begins with the way that it represents its numbers. They are used to represent two things: Whole and Fractional Numbers. To start with...in Trinary systems, bits are really called trits. Its short for Trinary Digits.

    As if we didn't lack sufficient sexual jokes regarding current computer technology. Now we have to introduce "trits" into the fray. Now we're going to have to explaing to our mothers that they're using 32 trit computers. Or stop people from laughing when we mention we like lots of trits.

    I propose we quickly abandon this system in favor of quarternery logic. The possibilities for abuse of a trinary logic system (and its trits) are simply too many.

    1. Re:From a trinary computing tutorial... by teorth · · Score: 1
      Another poster provided trinary computing tutorial. On one of the pages for the introduction, the author writes:
      The basis for understanding Trinary Algebra begins with the way that it represents its numbers. They are used to represent two things: Whole and Fractional Numbers. To start with...in Trinary systems, bits are really called trits. Its short for Trinary Digits.
      As if we didn't lack sufficient sexual jokes regarding current computer technology. Now we have to introduce "trits" into the fray. Now we're going to have to explaing to our mothers that they're using 32 trit computers. Or stop people from laughing when we mention we like lots of trits.

      I propose we quickly abandon this system in favor of quarternery logic. The possibilities for abuse of a trinary logic system (and its trits) are simply too many.

      Nah, if we did that then we'd have to call it qits.

      Terry

  78. Re:Moore's law needs to be repealed by Anonymous Coward · · Score: 0

    no, the ACLU is....

    The Bill of Rights permit free speech and free
    expression of religion. The excuse used by the ACLU is the Establishment Clause, which was designed to prevent a Federal Religion. Also, it does NOT say that the state of ALA can not have a state religion - some like MD do. The 14th ammendment (illegally ratified, by the wey) has been used to expand the rights of the US Government to take away rights from the states (a war was fought over these issues in 1861-65).

  79. Re:It's commonly assumed that people are base-10.. by Mr.+Sketch · · Score: 5, Insightful

    We have 10 fingers, 10 toes, etc. We can handle base-10 math easily, but not base-2 math.

    Maybe you only use your 10 fingers to count to 10, but any self-respecting geek will use those 10 fingers to count, in binary, up to 1023 by using both states of their fingers to represent a one or zero (up or down). A base-1 system on your fingers is just a waste of states. With some practice you can even handle the unusual states like 21 and 27 easily (I use my thumb as 2^0).

  80. Impractical in hardware by promethean_spark · · Score: 1

    We can certainly build 4 state logic, Flash already does this to squash 2 bits into a single flash cell.

    However if you can't build a 4 state gate with fewer than twice the transistors of the binary gate, you will use more die area. If you fiddle with an inverter you can get it to produce vcc/3 when vcc*2/3 is put on it's gate, but the inverter has a lot of gain between the supplies, so any deviation on the input will be magnified. A circuit with a stairstep-like transfer function is needed to fix this, and that would require lots of parts.

    Also in a 2 supply system forcing a gate to output vcc*2/3 would allow DC current to flow, which adds to the power problem. If you use 4 supplies then you'll be wasting area.

    Multi-level logic is fine for RAM and storage applications since you only use sqrt(n) decoders, where n is the number of bits, so they can be big and complex.

  81. Correction by Maimun · · Score: 1
    XOR is complement modulo m
    Sorry, a busy day. Negation is complement mod m. I can't remember about XOR.

    Also, in the binary case, AND and NOT (say) are a basis, any other function can be expressed in those. I dunno if that holds for m-values logic.

  82. Perhaps, but... by Anonymous Coward · · Score: 0

    Like white guys the world over, Aristotel does more with less ;)

  83. So how will this affect Federation computing? by Anonymous Coward · · Score: 0

    Will the Enterprise have to retool the fleet to reflect the new technology?

  84. Yeah, BUT... by Anonymous Coward · · Score: 1, Insightful

    You have to worry a lot more about intermediate states.

    Consider a ternary machine. There are three states-- represented, let's say, by 0V, 3V, and 6V (yes, I know, this probably wouldn't be the case-- work with me).

    To go from the 6V state to the 0V state (or vice-versa), the signal will momentarily pass through the 3V state. While this may not seem like a big deal, you need to consider what it could mean when that intermediate state is active-- entire parts of a ternary CPU could be activated.

    Mind you, if every subsystem is watching the clock like a hawk, it makes it a lot easier. But it's still another design consideration that makes ternary (and quaternary) computing a LOT more complex than binary computing.

    Not only that, but binary logic has some convenient tie-ins with various branches of math, notably number theory. Mersenne primes would be a royal pain in the ass in ternary (though quaternary logic wouldn't be bad, I suppose). Similarly for the square-multiply exponentiation algorithm.

    Not to say that non-binary computing doesn't have potential, but there are going to be a LOT more changes to consider than simply "how large a number will fit in a 32-trit register".

    Food for thought.

  85. Re:It's commonly assumed that people are base-10.. by slothman32 · · Score: 1

    Hey I only have 2 parents, 2 grandparents, 2 great grandparents... Don't discriminate against us yokels.

    --
    Why don't you guys have friends or journals?
  86. Toomuch heat? by anethema · · Score: 2, Interesting

    The problem I see with this is:

    Already our processors are dissipating a serious amount of heat. This heat is developed only during the switching time.

    Picture a cpu clock:

    _|-|_|-|_|-|_

    Haha, something like that. Anyways, the heat is only developed during the vertical bars of that clock. (Because the vertical bars arent perfectly vertical in the real world and that P(heat)=VI. During the horizontal bars, only V or I are present, so no power, ie: no heat)

    I dont exactly know how this ternary or quaternary computing works, but if its forcing the transistor to work in stages between full off and full on (1 and 0), you will be increasing the heat output by your cpu exponentially.

    Correct me if im wrong on this, but maybe we'll really need those diamond semiconductors to make this feasable for high computing power applications.

    --


    It's easier to fight for one's principles than to live up to them.
  87. Re:Silica based real estate by deglr6328 · · Score: 1

    "Or will Moore's law continue without the need for doing more with less silica based real estate?"

    Mmmmmm, silica based real estate....

    sorry, as a chemistry geek I'm required by federal law to make a joke when someone confuses Silica or Silicone with Silicon. :-]

    --
    - "Hear that?! The percolations are imminent! Cease your ingress!"
  88. Base 3 or 4 logic is NOT smaller than base 2. by Eric+Smith · · Score: 5, Informative
    A move to multi-valued logic provides more computational capability without the standard increase in die size or transistor count.
    No, it doesn't. Let's see you design a 16-quat full adder that takes fewer transistors or less die area than an 32-bit full adder.

    Base 3 or higher are a lose for implementing logic. Base 4 is useful in some kinds of memory, and this has been done by Intel since around 1980-81. Intel used a quaternary ROM (two bits per cell) for the microcode store of the 43203 Interface Processor, and (IIRC) for the 8087. More recently this technique has been used in flash memory.

    1. Re:Base 3 or 4 logic is NOT smaller than base 2. by Tim+Locke · · Score: 1

      You didn't read the article did you?

      The article states why base 3 is the most efficient.

      --
      *** On the Internet, no one knows you're using a VIC-20
    2. Re:Base 3 or 4 logic is NOT smaller than base 2. by khallow · · Score: 1
      I read the article, and I didn't see anything stating that base 3 was more efficient. Eg, we're ignoring the costs of converting between base 2 systems and base 3. What sounded more interesting was a base 4 system, which apparently can be done in SiGe.

      Still I wonder if a higher base system can fit in the same space as a two state system. Even though the article says they can do it, I wonder about noise issues. It simply is a lot easier to distinguish between two states than between three or more states.

    3. Re:Base 3 or 4 logic is NOT smaller than base 2. by promethean_spark · · Score: 1

      Those SiGe heterojunction devices are BJTs, they're fast because their speed is determined by a vertical dimention (base thickness) instead of a lateral one (CMOS gate length), which is controlled by implant depth rather than lithography. However, they're quite large compared to CMOS gates. Plain jane silicon BJT ECL logic will run at 10-20GHz, but the size and power constraints bar their use for VLSI.

    4. Re:Base 3 or 4 logic is NOT smaller than base 2. by Eric+Smith · · Score: 1
      You didn't read the article did you? The article states why base 3 is the most efficient.
      Yes, I read the article, and it provides no actual support for the conjecture that base 3 will be more efficient in practice for useful circuits. It only claims that it is now possible to make simple ternary gates that aren't as inefficent when implemented with heterojunction devices as they were with mainstream semiconductor technology.

      Sure, you may be able to make an efficient gate of some sort. But that's not the same thing as being able to build an efficient adder, multiplier, instruction decoder, or other practical structures needed to build microprocessors and other useful chips.

  89. Re:Survey (Zen & the Art of Motorcycle Mainte by Anonymous Coward · · Score: 0

    Unask the question!

  90. Base 5 is the way to go by SlydogSZ · · Score: 1

    Off 1/4 on 1/2 on 3/4 on full

  91. Chickens and trinary Truth Tables by RobertB-DC · · Score: 1

    not true you are baising your logic on the ordering or the lattice

    Cool thought -- too bad it's from the AC!

    How indeed would you work a trinary system where:

    A > B
    B > C
    C > A

    In HS biology, there was a chart of "pecking order". The chicken on the top (A) could peck anyone, the next chicken (B) could peck anyone but A, and so on. We had a chart like this, but note what happens to chickens D, E, and F:


    o A B C D E F G
    A - X X X X X X
    B - - X X X X X
    C - - - X X X X
    D - - - - X - X
    E - - - - - X X
    F - - - X - - X
    G - - - - - - -


    D can peck E, E can peck F, but F can peck D. So even though D is greater than E, and E is greater than F, D is not greater than F.

    This isn't the sort of trinary (ternary, tritiary, whatever) logic I've seen referenced in any of the links I've seen so far.

    What's the number for the patent office again?

    --
    Stressed? Me? Of course not. Stress is what a rubber band feels before it breaks, silly.
    1. Re:Chickens and trinary Truth Tables by KiahZero · · Score: 1

      It's Condorcet ranking with circular ambiguity, as far as I can tell.

      Election Methods

      Sure, you're not talking voting, but the ranking at the end of the vote is, if I read you correctly, the same thing as what you're talking about.

      --
      I'm a lawyer, but not yours. I wouldn't represent someone who thinks taking legal advice from Slashdot is a good idea.
    2. Re:Chickens and trinary Truth Tables by Fred+Ferrigno · · Score: 1

      I don't understand why D can't peck F, or why F can peck D. Was this particular to the arrangement of chickens on the chart you refer to?

    3. Re:Chickens and trinary Truth Tables by RobertB-DC · · Score: 1

      I don't understand why D can't peck F, or why F can peck D. Was this particular to the arrangement of chickens on the chart you refer to?

      As I recall, it's just an observation -- F pecks D, even though F should be "lower" in the pecking order (and indeed, is pecked by E). I think the textbook may have said that this was an intermediate situation -- F is on her way up or down the pecking order, and that "normalcy" will return once F finds her place.

      Remember, this was in high school (or possibly before), so I've had almost two decades to forget the details...

      --
      Stressed? Me? Of course not. Stress is what a rubber band feels before it breaks, silly.
  92. Speed and operations by Anonymous Coward · · Score: 1, Informative

    IIRC from MAT/CSE460, trinary (-1,0,1) is great for multiplication and division but sucks at addition and subtraction. With the opposite being true for binary (special cases like powers of 2 excepted).

    I also thought the great advantage for transistors was speed (and power savings as a previous poster noted). You can drive one into cutoff or saturation very fast.

  93. Related articles by Anonymous Coward · · Score: 0

    http://www.trios.org/

  94. Binary compatibility by HTH+NE1 · · Score: 1

    As long as the hardware can still be programmed as if it were binary based, using other bases only as needed, then it might be worthwhile. But if you have to completely rethink how you program everything to handle other-base logic, it won't take off. We'd have to be eased into it.

    --
    Oh, say does that Star-Spangled Banner entwine / The myrtle of Venus with Bacchus's vine?
  95. Re:Just base 3 or 4? How about base pi, e, i, 1,.. by xv4n · · Score: 1
    Base 2,3,4, and 10 are so easy. If you really want a challenge, build a computer using base pi, e, i, 1, or 0

    Take it to the extreme man, learn base -(-1^1/2), i.e. base -i, negative imaginary base. :)

  96. Where, where? by Anonymous Coward · · Score: 1, Informative

    The phrase is "hear, hear". Saying it wrong makes you look like a dumbass. Dumbass.

  97. Certainly nothing new by ded_guy · · Score: 1

    After all, TriINTERCAL has supported this for a long time. And, of course, the extra necessary operator is BUT.

    --
    In the future, all spacecraft will be made of cheese.
  98. Re:Moore's law needs to be repealed by Anonymous Coward · · Score: 0

    Read the First Amendment again. I think you'll see that you're quite wrong.

  99. Its the future by Hecatonchires · · Score: 1

    I remember reading a scifi parody/comedy where it was stated that "true AI was not developed until ternery logic was developed (yes, no, maybe). This explains why all AI's are female."

    I wish I could remember the name of that story.

    --

    Yay me!

  100. Not just memory by FuzzyDaddy · · Score: 1
    Actually, multi-level memory has been around for a while, at least in flash memory. It always seems to be implemented in powers of two (A four or eight level gate), so a single storage cell can hold multiple bits.

    Flash memory cells, however, are read by an analog sense amplifier, so multi-level LOGIC doesn't really come into play. And I think it's the multilevel logic that really presents the challenges.

    --
    It's not wasting time, I'm educating myself.
  101. isn't it about the metal? by child_of_mercy · · Score: 1

    are these multi state transistors available at the basic level?

    I thought computings binary nature came form the on/off nature of the transistors.

    anything else requires abstraction, overhead, waste thats best done higher up in the stack right?

    the metal dictates the computing as i understand it.

    if someone makes really good chips with 3 state transistors then I imagine the 3 state computer logic will quickly follow.

    your quantum computers, for example will use something mind bogglingly more complicated I'm sure.

    --
    'There is a Light that never goes out.'
  102. problem with non-binary computing by u19925 · · Score: 1

    as you increase number of bits, you need to increase signal strength to differentiate the multiple levels that are created. this requires more power and in the end you lose. in general a bandwidth increase is better way to increase communication speed than increasing signal strength and the same applies to computing. i don't have the precise figure, but during my studies, we did some calculations about power required vs number of bits of computing and it turned out that theoretically, a best system uses "e" number of levels (e=2.718....).

    now i know this is funny, but atleast in one of the systems used (in 80s and 90s), by NASA, the A/D converter was a 3-level converter (not 3-bits). in their signal, the noise dominates over signal, so multiple samples are averaged. you can increase quality of each sample, but then tape can store less samples. most common practise is to use 1-bit converter in these kind of systems. the ideal converter is to use e-level converter. 3-lever was a better compromise.

  103. Re:It's commonly assumed that people are base-10.. by MyHair · · Score: 1

    Two mommies.

    (Intentionally didn't try to add words to make it a joke because it wouldn't have been funny then, either. Hey, at least now that I said it you won't get some AC troll using it in an even stupider joke, so there.)

  104. Questions about hardware and tri- quat- computingu by Angelwrath · · Score: 1

    I have questions, not being a CSC or ENG, about what it means to go from binary to tri or quat.

    It seems a good fit that transistors correlate so well to binary computing. How does this work, for example take RAM transistors on a tri or quat system - with binary, the RAM transistor holds either current or no current to represent either the 1 or 0.

    How does storage of the trinary or quaternary systems work in this case?

    And am I right in thinking it takes more than one transistor for a RAM memory cell, as it does for a Static Ram cell?

  105. Ayn RAND! Ayn RAND! Ayn RAND! by Anonymous Coward · · Score: 0



  106. Fingers.... by EmbeddedJanitor · · Score: 1

    Well at least counting to 9 (ie 20 base 3) will be easier than hex. Only few of us embedded folks were born with sixteen fingers, and octal never really took off.

    --
    Engineering is the art of compromise.
    1. Re:Fingers.... by aardvarkjoe · · Score: 1

      (ie 20 base 3)

      Urm ... don't you mean 100 base 3? (9 = 1 * 3**2 + 0 * 3**1 + 0 * 3**0) Or am I misunderstanding?

      --

      How can we continue to believe in a just universe and freedom to eat crackers if we have no ale?
    2. Re:Fingers.... by EmbeddedJanitor · · Score: 1

      Yup, you're right. Dammit I can see some problems with this trinary stuff!

      --
      Engineering is the art of compromise.
  107. I like the indeterminant ternary logic concept by quinkin · · Score: 3, Informative
    I have always felt (but my models have failed miserably so far) that combining binary with uncertainty to create an indeterminant ternary logic would be extremely useful for many rule-of-thumb applications (ie. pattern matching, fuzzy logic).

    Picture a system with:
    1/3 power = 0
    2/3 power = alpha
    3/3 power = 1

    Now consider the case of recursion where each iteration must be deffered until the one above returns - by using uncertain values instead you may be able to perform a range of forward-possibilty operations upon the as yet indeterminant numbers.

    When the higher order recursion results eventually (lets assume) returns a value that determines the alpha value all that is required is to create a specific instance of the generalised results.

    I like the concept - and it seems it could easily be integrated on the same die as a standard ternary chip.

    Q.

    --
    Insert Signature Here
    1. Re:I like the indeterminant ternary logic concept by dasmegabyte · · Score: 3, Informative

      The problem with this is that fuzzy logic is no more ternary than it is in binary. Fuzzy logic is about effectively weighing options. With ternary logic, you've only increased your options by 50%. Fuzzy logic is generally probabalistic...which means it's nicest when utilized with sufficiently large integers or, more importantly, huge floating point numbers. Like a nice 64 bit quad.

      Consider a typical "fuzzy" logic problem of when to stop a car. You want to weigh variables like the speed of a car, the amount of force to apply, distance to the stopping point and other options like the existance of pedestrians (generally, if there's people within 20 feet of your stopping point, like say at a bus stop near a stop sign, you'll want to slow down quicker at first but roll longer, to decrease the effect of a fluke accident).

      Lots of variables. Lots of choice. Lots of probability to weigh. Having an extra option out of 3 does not help you. Having 64 bits to work with does.

      I have a hard time coming up with problems in my line of software dev in which ternary or quaternary logic is any more useful than nested binary logic or some fun probability and calculus. Mostly because it's rare that I care about anything other than STOP or GO, ON or OFF. About the only time I do care is when I'm dealing with a database (YES, NO or NULL [no data])...all the rest of the time, alternative options are best handled with an enumerated type or a nice exception.

      Anyway, it's all well and good to talk about ternary computing being 'faster' with less overhead, but it's never really going to take off. It will take at least an extra year to train engineers to use the new logic effectively and for them to learn the tricks...and in that year, binary computing will have doubled. And when you live in a world where most software isn't optimized anyway...waiting for a slightly faster logic system that 9/10 of programmers will merely treat as binary because it's easier to understand in more comfortable is a waste of everyone's resources.

      Even the terminology is bad. True, false, alpha. Ugh. If P is sort of true, then kind of do q.

      --
      Hey freaks: now you're ju
    2. Re:I like the indeterminant ternary logic concept by Anonymous Coward · · Score: 0

      As Socrates once said when one of his students recommended a value to represent uncertainty... of what are you uncertain about?

      The answer is if something is true or false of course.

    3. Re:I like the indeterminant ternary logic concept by metamatic · · Score: 1
      I have a hard time coming up with problems in my line of software dev in which ternary or quaternary logic is any more useful than nested binary logic or some fun probability and calculus.

      Having "true", "false" and "error" would be damn useful. Of course, it doesn't necessarily have to be implemented all the way down to the hardware level...

      --
      GCHQ Quantum Insert installed. If only our tongues were made of glass, how much more careful we would be when we speak
  108. Not Realy by Mooncaller · · Score: 1

    4-state is more usefull: Yes, No, Either, Neither.

  109. Re:Perfect for women and voting machines! by ratfynk · · Score: 1

    Much better suited for voting machines in Florida too. Really good for registering a vote for nobody!

    --
    OH THE SHAME I fell off the wagon and use sigs again!
  110. n-valued logic by x42 · · Score: 1

    natural logic (used in common life, common sense) is NOT binary. quantum-mechanical systems can be described more naturally using all continous values between 0 and 1. a simple but working approximation using 5-valued logic in such systems was developed shortly after their introduction.
    nature is NOT binary and nature does NOT treat all continuous values equally. certainly our understanding of this could be extended using n-valued logic in the hardware implementations of computers.

    1. Re:n-valued logic by x42 · · Score: 1

      addendum :-) a possible and practicable method implementing a 5-valued logic using polarization states of photons could be : -2 : horizontal linear -1 : left circular 0 : unpolarized +1 : right circular +2 : vertical linear

  111. Quantum computing and other bases... by krymsin01 · · Score: 1

    AFAIK, Quantum computers have all been currently theoreticly applied to a binary computing model, using the spin of electrons as the bit storer. How would this work in tertiary, or anyother base for that matter?

    --
    stuff
    1. Re:Quantum computing and other bases... by x42 · · Score: 1

      there is a coupling between intrinsic spin of electrons and their angular momentum - leading to different discrete observable states (with external magnetic fields present, this can be even more interesting)

    2. Re:Quantum computing and other bases... by krymsin01 · · Score: 1

      Thanks for the info. It'll be interesting to see if anyone ever goes beyond the theoretical on this.

      --
      stuff
    3. Re:Quantum computing and other bases... by x42 · · Score: 1

      not in our time ... according to the insights gained in the early days of the copenhagen-interpretation of quantum physics the MEASUREMENT of a single electron state would change it !

  112. Re:Just base 3 or 4? How about base pi, e, i, 1,.. by fliptout · · Score: 1

    Next, try to build a circuit that computes -i^(1/2). Fun with a capital F. =)

    --
    A witty saying proves you are wittier than the next guy.
  113. There are only 3 kinds of people in the world... by deadcasuals · · Score: 1

    ...those who can count in tertiary and those that can't.

    I'd give my right arm to be ambidextrous.

  114. Baloney! by DrMorpheus · · Score: 1

    Star Trek's computers are based on Trionics! Remember "The Ultimate Computer" episode? Oh, wait, that's right nobody on Slashdot has seen the original series....

    --
    Debunking the "59 Deceits"
  115. boolean logic by Anonymous Coward · · Score: 0

    Wake up you fools, you are asleep - yes you are, no you are not. Foolish slashdot

  116. Re:That "2" you assumed by Lord+Bitman · · Score: 1

    Have you never heard of XOR? This is what you've just discovered

    --
    -- 'The' Lord and Master Bitman On High, Master Of All
  117. Why Limit The System To Any Given Logic? by xelph · · Score: 1

    ... when you can use all kinds of logic all at once. See the Pile system at http://www.pilesys.com/tech.htm

  118. Counting on my fingers by Erik_the_Awful · · Score: 1

    Cool! Now I can count to 242 on one hand! Sure makes my knuckles hurt though.

    1. Re:Counting on my fingers by __aagmrb7289 · · Score: 1

      But can you count to -242?

    2. Re:Counting on my fingers by Erik_the_Awful · · Score: 1

      Ahh Crap! What the heck do I do with my sign finger?

      Hey, Wait! Who counts signed integers on their fingers? Most people I know count unsigned base 10 integers only... :>

  119. If It's Trinary or Quaternary, Choose Quaternary by istartedi · · Score: 1

    It's still a power of two. People will have an easier time grasping it. People are used to CPUs doubling registers, addressable memory, etc. so doubling switch state possibilities seems like a natch.

    Trinary, or any base not a power of two, will just wierd people out.

    The best thing to do is make it as transparent as possible. An 8-quadbit register is the same as a 16-bit register. From the assembly programmer's POV, it should be possible to treat it the same way.

    --
    For all intensive purposes, "whom" is no longer a word. That begs the question, "who cares"?
  120. Need better Emusic evangelism by Mawbid · · Score: 1
    Tired of the music industry ripping you off? Try another way: emusic

    You might want to rework that a little to give it a safe distance from the good old...

    Don't go elsewhere to get ripped off, come to us!

    I know your doesn't actually say that, but it's the first thing came to mind when I read it :-)

    --
    Fuck the system? Nah, you might catch something.
    1. Re:Need better Emusic evangelism by 26199 · · Score: 1

      Heh. Hadn't thought of that.

      Eh, not as if anyone takes any notice anyway :-)... maybe it's time I came up with something witty though. Hmm...

  121. What a waste of my time. by Anonymous Coward · · Score: 0

    So here we are, markets starting to come to a halt because we have the RAM we need, the processors are fast enough for our use..

    Solution? Let's introduce a new system that will sell for decades while we think of another scheme to make money off our gullible consumers, which pay our salaries (*warning* potential corrupt link detected).

    I think that the reasons for going from binary to whatever are vague and weak. Signals will be more susceptible to noise, turning a fuzzy maybe to a yes.

    We already have a nice ternary system using condition-codes (negative, zero, positive).

    This article is to me a *strong* hint that they have NOTHING innovative to create, and now they try to force change where change is not needed.

    Either we exist, or we don't.

  122. Whattaya mean, "Never really caught on"? by Iparadox · · Score: 1

    Almost all modern machines (chips, what-have-you)that do serious multiplication (i.e., not necessarily embedded systems) use something called Booth coding. I am not so sure that it is beneficial, but all the major manufacturers think so, so they use it. One of the multiplicands is converted to a multimode binary number (digits have values of -1, 0, 1). It saves a bunch of time on repetitive additions, especially when accelerated with a Wallace tree. The original Booth paper was published in 1951, but no one seems to have a copy anymore (boy, I would love to get my hands on a copy of that!) "I don't need no stinkin' sig"

  123. logic circuits don't like trinery and beyond by geekee · · Score: 3, Informative

    Most logic circuits, from an analog perspective, are amplifiers. Rather than operating in the linear region, however, these amplifiers, are overdriven to force the output to rail at one extreme or the other , producing a high or low voltage level (0 or 1). CMOS works particularly well iunder these conditions because, in steady state, only a small leaskage current flows through the circuit when it's railed. As the author indicates, you can design logic by comparing a voltage to a fixed threshold, such as in ECL, CML, SCFL, etc., but these circuits are based on differential amplifiers, which typically burn significant current at all times. Not to mention that it's difficult to imagine a circuit which can generate more than to voltage values that does not use significant current at all times. Therefore, it seems the price of non-binary logic in most cases is increased power, which is not a trade-off anyone's willing to make (Flash RAM is an exception because of it's unique nature).

    --
    Vote for Pedro
  124. Trits by Anonymous Coward · · Score: 0

    Unfortunately, the actual name is "trits." People doing Quantum Computation use them all the time (since you just take whatever you can get, and some atoms & ions just happen to have 3 states).

  125. something for nothing? by Anonymous Coward · · Score: 1, Insightful

    A move to multi-valued logic provides more computational capability without the standard increase in die size or transistor count.

    yeah right.... lets just move to near infinite values to have near infinite computing from the same transistor count! Shannon and Nyquist be darned!!

  126. zerg by Lord+Omlette · · Score: 1
    Is the need to make do with the current fabrication technology enough to drive the move to multi-valued logic? Or will Moore's law continue without the need for doing more with less silica based real estate?"
    Yes.
    --
    [o]_O
  127. ternary logic as kids by frankmu · · Score: 1

    we used to use it all the time to make decisions:

    rock, scissor, paper

    --
    Supreme executive power derives from a mandate from the masses, not from some farcical aquatic ceremony.
  128. ternary logic... by holzp · · Score: 1

    yes, no, maybe.
    computer would have an answer to everything, maybe.

  129. Re:Just base 3 or 4? How about base pi, e, i, 1,.. by Anonymous Coward · · Score: 0
    It gets even more fun where the "base" changes from one digit to another.

    For example, you can create number systems where all rational numbers. No infinitely repeating decimals.

    IIRC, this works if by having each of your prime-numbers at a given position.

    The idea is that a number gets represented like this:
    22221 = 2*(11) + 2*(7) + 2*(5) + 2*(3) + 1*(2)
    or
    .123 = 1*(1/2) + 2*(1/3) + 3*(1/5)

    but I forget the name of this system

  130. Re:It's commonly assumed that people are base-10.. by wirelessbuzzers · · Score: 1

    With some practice you can even handle the unusual states like 21 and 27 easily (I use my thumb as 2^0).

    Yeah, but watch out for 132.

    --
    I hereby place the above post in the public domain.
  131. hai by usotsuki · · Score: 1

    kyou wa ne, banana ga arimasen.

    -uso.

    --
    Dreams, dreams, don't doubt dreams, dreaming children's dreaming dreams. Sailor Moon SS
  132. Ternary useful for async? by wirelessbuzzers · · Score: 2, Interesting

    Ternary computing could be quite useful for asynchronous logic. The three states would be 1/yes, 0/no, and n/(no answer yet).

    Basically you want the truth table to be, in order of precedence:
    0 AND * = 0
    n AND 1 = n
    n AND n = n
    1 AND 1 = 1
    (OR is the reverse, swap 0 and 1)
    NOT 1 = 0, NOT 0 = 1, NOT n = n

    Gates can be actually made to follow the right truth tables by diddling your substrate voltages in an otherwise fairly standard CMOS design; this has the effect of making your circuit twice as slow or quadrupling its power consumption though, which sucks. You also have to watch your noise thresholds here, transients can be nasty although they are unlikely to propagate far through a network of n's. This can be mostly fixed by further tinkering with thresholds, but then the leakage current becomes prohibitively high.

    You can also just design extra logic with standard gates and watch your glitches very carefully.

    There may be cleverer ways to do this, or the savings of asynch might be enough to make it useful anyway.

    --
    I hereby place the above post in the public domain.
    1. Re:Ternary useful for async? by Trogre · · Score: 1

      Gates can be actually made to follow the right truth...

      If only that were so...

      --
      "Nine times out of ten, starting a fire is not the best way to solve the problem." - my wife
  133. How about a random based computer? by Anonymous Coward · · Score: 0

    each computer chip has a unique number base that it's based on.
    the number of bits per word is random.
    the protocols are random
    page size is random
    etc, etc.

    great for security
    great for one time use, throw-away computers.
    perhaps make them in pairs for secure communication,
    or perhaps a group of them for trusted computing between a group of developers.

    might be interesting...needs to be fleshed out though. :-)

  134. Or...random rational, irrational, complex bases? by Anonymous Coward · · Score: 0

    That will surely piss-off any participatants in government spy-ware activities....

  135. Re:It's commonly assumed that people are base-10.. by nuntius · · Score: 2, Funny

    Yeah, but decimal 132 or 891 tends to offend people, depending on how you define your states.

    Hint:
    132 = 00100 00100
    891 = 11011 11011

    Besides, nearly half the states are uncomfortable for most people.

    True geeks rely on their HP calc for math; manual calculation is for nerds. :P

  136. Re:Just base 3 or 4? How about base pi, e, i, 1,.. by convolvatron · · Score: 1

    try continued fractions

  137. Trinary logic according to MS by xphread · · Score: 0

    Abort, Retry and Fail are the only possible outcomes after using the only possible inputs of Ctrl, Alt, Del.

  138. This is insane. by 222 · · Score: 1

    Generally reading, i already feel a bit daft and behind the times with the /. crowd, but now you have me running to dust off textbooks long thought lost?
    I give up, im going back to basketweaving.

  139. Base 10 computing would be nice....... by Anonymous Coward · · Score: 0

    If the technology is there to do base 4 then they may as well go for broke and do base 10. Why waste the effort on another 'broken' system.

    We could also go completely analogue and just dump the binary computer all together. Circuits are accurate enough now, we don't need binary anymore.

    Analogue computers are faster than digital anyway.

  140. Binary is the building blocks of existence by jcsehak · · Score: 1, Interesting

    Think about it: male/female, life/death, something/nothing; it goes back ages into daoist philosophy, and you all know the yin/yang, right? If there was no male/female, we'd all be at a bacterial level. Now look closer at the 1 and the 0. 1 = phallus, 0 = hole (vagina).

    And when you get down to the quantum level (and correct me if I'm wrong (and I'm sure you will), because I'm no quantum physicist), you find that electrons sort of blink in and out of existence -- you can only measure them in terms of probability of them existing at a certain point in time. It seems like reality as we know it is based on a binary system.

    Add to that how computers are affecting just about every way of life, even after being around a mere half century. There's some sort of big interconnectedness going on here, I think. Binary all the way.

    --

    c-hack.com |
    1. Re:Binary is the building blocks of existence by x42 · · Score: 2, Insightful

      forget probability ...
      you are right ... quantum physics is wrong :-)

      reality is not binary.
      much confusion comes when separating right/wrong,
      truth/false ... many systems simply exist beyond the limited scope of binary logic and are almost incomprehendable in such frameworks.
      there are no absolute truths !

      acording to quantum theory YOU change the state of an electron simply by looking at it ... can you comprehend this in a 2-state logic ?

      if we cannot decribe even simple quantum phenomena using 2-logic how could we ever dream of decribing more complicated things ?

      nature is simple ... so simple, that we are not able to comprehend it fully :-)

    2. Re:Binary is the building blocks of existence by Anonymous Coward · · Score: 0

      acording to quantum theory YOU change the state of an electron simply by looking at it

      In Soviet Russia, an electron changes the state of YOU!

  141. Aymara by fven · · Score: 3, Interesting

    The aymara people have used trivalent logic for thousands of years. It allows precise definition of "maybe" or "possibly"

    There is a great writeup of these people and their logic at:

    http://www.aymara.org/biblio/igr/igr3.html

    The article mentions that it is very difficult to impossible to express the logic of one culture in the language of another. Thus to understand better the inferences in Aymara logic, we have to resort to mathematics, which is sufficiently general to be understandable and translatable.

  142. We REALLY don't have any fucking bananas. by Ayanami+Rei · · Score: 1

    (I'm from New York, okay?!)

    --
    THIS THING CAN TURN ON A DIME, MACROSSZERO STYLE ALSO FUCK BETA, ~NYORON
  143. The more general problem ... by Ninja+Programmer · · Score: 1

    The usefulness of binary logic is not a relic. Its necessary. Software today heavily relies on the following:

    1. Ordinary boolean logic: AND, OR, XOR, NOT. There is no simple way to implement these in bases other than bases which are powers of 2. You *CANNOT* get away with not implementing these in instructions sets. The silicon would be forced to emulate/implement these as some kind of ROM-table look up.

    2. Integers being exact powers of 2 in size. There are many bit hacking tricks that "shift bits off the top" which will not work as expected. There is no way to fix this.

    Note that an OR operation can actually lead to an OVERFLOW! There are numerous masking tricks that will fail because of this:

    x = HIGH_BITS | y;
    z = x & SOME_MID_TO_LOW_BITS;

    Today's programmers assume that so long as HIGH_BITS and SOME_MID_TO_LOW_BITS don't intersect, then the two lines can be interchanged in order without effect. But because in base 3 the first line can overflow, there's no way to preseve this property.

    I think of using ternary logic as kind of like trying to put square carpet in a pentagon shaped room. It makes no sense to me.

    ----

    All this being said, if I am not mistaken base 3 is ALREADY BEING USED(!) internally in certain ALU operations. For example, I am told that FPU multiplication can be (and are) significantly sped up by switching to a base 3 representation (versus a direct binary implementation.)

    The reason why ternary works for something like this is because multiplication can be (and is) implemented without relying on bit logic, but just adder (and the consequence arithmetic "RING" that follows) logic.

    So ... even if you could convince the silicon manufacturers to consider a base 3 CPU, they wouldn't necessarily gain very much for certain operations like FPU multiplication where it is already being leveraged.

  144. Obvious ... by Ninja+Programmer · · Score: 1

    ...
    4. Profit!

    But I guess that doesn't really fit in with a discussion of base 3 ...

  145. Trinary? 0s, 1s, and 2s by momerath2003 · · Score: 1
    We all know that 0 stands for "no" and 1 stands for "yes"

    What does 2 stand for? Reply hazy, try again later?

    --
    I had but a simple dream, to destroy all humans.
  146. boolshit by DannyiMac · · Score: 1

    True and false, right and wrong, yes and no, ping and pong... nothing else! Anything else would be false.

    --
    - Danny
    1. Re:boolshit by Anonymous Coward · · Score: 0

      A real engineer thinks 'outside the box'.

      'Anything else is false', ....stop being compulsive!

  147. Ah, some pedantic semantic conflict by quinkin · · Score: 4, Insightful
    (Moores Law = A Law) => Tripe

    (Exponential Growth = Unbreakable) => Tripe

    I hate to add fuel to this sort of fire, but is Moore's "Law" a law, or an "observation"? They are not equivalent.

    "...historical trend that hasn't been broken in thousands of years." - What codswallop. In a theoretically infinite universe this may be the case, but real life is never that simple. Exponential growth of velocity - diminishing returns as you approach the speed of light. Exponential population growth - always a ceiling....

    I could go on and on - but I won't.

    Q.

    --
    Insert Signature Here
    1. Re:Ah, some pedantic semantic conflict by Saeger · · Score: 2, Interesting
      is Moore's "Law" a law, or an "observation"? They are not equivalent.

      It's closer to an observation than a Law, since scientific laws are usually mathematical descriptions of our worldly observations. e.g. I can observe that an apple falls "faster and faster", but Newton's Laws describe that motion more precisely (and Einsteins theories go a step further by attempting to explain, rather just describe what he observed).

      Exponential growth of velocity - diminishing returns as you approach the speed of light.

      The Speed of Light would *be* the Singularity in the case of the evolution of transportation (unless you count some future hyperspace possibility as the Singularity, but you're not really moving through space then, but slipping between it).

      Exponential population growth - always a ceiling....

      Yes, there's a ceiling on the number of physical human bodies that can occupy a sustainable planet Earth. But we'll be expanding outward into space, as well as inward into virtual space at an ever increasing rate.

      I think you're maybe confused about the definition of the technological Singularity. It isn't a truly infinite blackhole-type singularity in the mathematical sense of the word, but rather an amount of change so vast that current human minds can't comprehend.

      A quote from Kurzweil's Law of Accelerating Returns:

      Observers are quick to criticize extrapolations of an exponential trend on the basis that the trend is bound to run out of "resources." The classical example is when a species happens upon a new habitat (e.g., rabbits in Australia), the species' numbers will grow exponentially for a time, but then hit a limit when resources such as food and space run out.

      But the resources underlying the exponential growth of an evolutionary process are relatively unbounded:

      --

      --
      Power to the Peaceful
  148. lets say this.. by redJag · · Score: 1

    Well I browsed through the first page and my eyes are asking for a break, so I'm going to say what wasn't said on the first page (maybe on later pages):

    There's 1 kinds of people in the world, those who can read trinary and those who can't.

  149. Intrinsity's NDL Logic works on n-values by Anonymous Coward · · Score: 0

    Intrinsity has quite a few patents around a logic family which in called NDL based around multi-valued signals. Not to be confused with multi-level signals.

  150. Done already.... by PrimeWaveZ · · Score: 1

    Didn't Intel use this kind of math in its first Pentiums? :)

    But seriously, a friend of mine and I joked about trinary computing (our term) back in 7th grade and how cool it would be, making computer SO much more powerful. The fact that it is being discussed on /. makes me feel so far ahead of the curve it's not even funny.

  151. Re:MOD PARENT UP by ImpTech · · Score: 1

    Goddamnit, and here I already posted before I could mod up your post...

    stupid anti-abuse moderation system

  152. what the... by Paul+d'Aoust · · Score: 1

    who the hell modded this guy as insightful?!? someone should take away their mod points. (ha, love the way HookedOnPhonics' website is the Merriam-Webster Dictionary tho ^_^)

    --
    Standing at the very edge of my imagination, I peered into the inky void and realised -- I couldn't think up a new sig.
  153. Moving to base 3 is a blessing by oren · · Score: 1

    Base 3 is the only truly beautiful base. Not only is it optimal in a theoretical sense, it would dramatically improve the quality of life of geeks everywhere. True, they would still not get any, but at least instead of working with boring bits and bytes they would switch to thrilling tits and tights. I say, go for it!

  154. Nice Trits. by Anonymous Coward · · Score: 0

    In your estimation, then, a ternary computer would be pr0n optimal?

  155. Why stop at quaternary by ecloud · · Score: 1

    If you had 16-level logic, one hex digit could be represented in a single cell of a register. That might be convenient.

    The memory ought to be 9-digit (equivalent of 36 bits) so you can have type flags associated with every value (integer, float, pointer, etc.) It would make implementing dynamically typed languages a breeze and we could get rid of statically-typed languages without losing efficiency.

  156. Re:It's commonly assumed that people are base-10.. by TroZ · · Score: 1

    Personally, I like to use base 6 when counting on my hands. This lets me count to 35 on my hands without any uncomfortable finger positions.

    I use the right had as the 'ones' hand and the left has as the 'sixes' hand. Each hand had six states (no fingers out, 1 finger out, 2 fingers out, ... , 5 fingers out).

    Counting to 5 is the same as normal (using base 1), Just put out one finger at a time or your right hand. To count six, just close your right hand and put out one finger or your left hand. Since the left hand is representing the 'sixes' place, your hands are representing 10 base 6 or 6!
    Continue putting our fingers on your right hand until it is full, and then close it and put out another finger on your left hand. Continue until you reach 55 base 6 (35 base 10), at which point you run out of fingers and hands.

  157. Important detail about truth tables by Sparr0 · · Score: 3, Interesting

    One important thing to remember about truth tables is that the number of operands (the numbers you give to a function to get an output) for a given operator is NOT always the same as the base. For base two you have two operand operations, which we all know as AND OR XOR, but you also have operations that require only one operand, the common NOT (1->0, 0->1) and what I will call EQV (1->1, 0->0). There are also 9 more two operand truth tables that you see in varying degrees of extreme rarity, f/e the following arbitrary truth table that you will never see in practice:
    A B out
    0 0 1
    0 1 1
    1 0 0
    1 1 1

    Apply this to base 3 and you find that there are not just 3-operand operations but 1 and 2 as well. For one operand you can have a rotate-down(0>2,1>0,2>1), shift-down (0>0,1>0,2>1), rotate-up (note that in binary one-operand rotation happens to coincide with NOT), shift-up, and various arbitrary tables like the one above. For two operands you have NeitherBoth (00>0,01>2,02>1,10>2,11>1,12>0,20>1,21>0,22>2), and the arithmetic operators, plus a bunch of others with explanations i cant think of right now. For three operands there are thousands of possible truth tables, many with useful explanations, many many more arbitrary ones. Oh, and for both 2 and 3 operands you have multiple partial or complete counterparts to the traditional binary AND OR XOR that apply the same kinds of rules to the operands.

    1. Re:Important detail about truth tables by JohnPM · · Score: 1

      There are 27 possible unary operators in ternary logic. As you say, many of them will not be useful, eg: 0->0 1->0 2->0

      There are 19683 possible binary operators and 7.6 trillion possible ternary operators. In boolean logic the numbers of possible operators are 2, 16 and 256 respectively.

      The real question that no one here seems to be asking is: what is a simple set of base operators from which all other operators can be constructed? Can such a base set be implemented in hardware? In boolean, a set of base operators is NOT and AND. For example:
      x OR y = NOT( NOT(x) AND NOT(y) )
      x XOR y = ( x AND NOT(y) ) OR ( y AND NOT(x) )
      = NOT( NOT(x AND NOT(y) ) AND NOT( NOT(x) AND y ) )

      --
      Karma police, I've given all I can, it's not enough, I've given all I can, but we're still on the payroll.
  158. Re:It's commonly assumed that people are base-10.. by dasmegabyte · · Score: 1

    Amateur. You have two joints on all your fingers and three distinct states -- up, bent, and down.

    That's ternary. And it means that instead of 1023, you can count up to 59049.

    Which is great for counting pennies before buying an iPod.

    --
    Hey freaks: now you're ju
  159. Ob Futurama Quote by Salsaman · · Score: 2

    Bender: what a strange dream...I thought I saw a '2'.

  160. Will it happen? by Rogerborg · · Score: 1

    Maybe.

    --
    If you were blocking sigs, you wouldn't have to read this.
  161. Associative processing by andyr · · Score: 4, Informative
    When I was at Brunel University on a post-grad course, we built chips for Associative Processing (pdf)> or Google HTML that inherently used Ternary logic. The main chip that we built was an Associative memory chip, that stored binary data, but was addressed by searching for data. There were no address lines. It was a wide field - 40 bits,(this was late 70's) and you presented a search term as Ternary data on the input lines. Each bit was 1,0,X - where X meant "don't care". You could add one field column to another, without any of the data exiting the chip.

    Say you wanted to add an 8 bit field - bits 0-7, to another, bits 8-15, and store the result in a 9 bit field, 16-24.

    Search as follows (CC Field is Carry):-

    Bits: C 1 1 1 1 1 1 1
    Bits: C 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0
    Find: X X X X X X X X X X X X X X X X X X # All rows
    Writ: 0 0 X X X X X X X X X X X X X X X X # Clear output
    Find: X X X X X X X X X 0 X X X X X X X 1 # 0+1=1
    Writ: 0 1 X X X X X X X X X X X X X X X X # write 1
    Find: X X X X X X X X X 1 X X X X X X X 0 # 1+0=1
    Writ: 0 1 X X X X X X X X X X X X X X X X # write 1
    Find: X X X X X X X X X 1 X X X X X X X 1 # 1+1=0 carry 1
    Writ: 1 0 X X X X X X X X X X X X X X X X # write 0 carry 1
    Whew. You have added the LSBs of the fields together, in 6 operations. There are 8 more to go. However, you have done it for the entire array which might be thousands of records.

    So there is a fixed processing time for parallel operations on all the data.

    We still had to use two input lines to represent the Ternary value, but, remember, no address lines needed.

    Content Addressable memory chips are also used for lookaside Cache memory in CPUs today.

    Cheers, Andy!

    --
    Andy Rabagliati
  162. Re:It's commonly assumed that people are base-10.. by bobbozzo · · Score: 1

    It's possible to count to 60 on your fingers and thumbs; the Sumerians (IIRC) did it, and that's why we have 60 seconds in a minute, 60 minutes in an hour, 360 degrees, ...

    I've seen it done... it involves using each knuckle on each finger, so each finger has 4 possible states (down, 1/3 up, 2/3 up, up), and each thumb has 3 states.

    --
    Nothing to see here; Move along.
  163. hex... by Anonymous Coward · · Score: 0

    what would hex be called in trinary?
    perhaps we can call it sex? :)

    then geeks would get sex more than anyone else ;)

  164. At last..... by Anonymous Coward · · Score: 0

    slashdot that i know...
    i was wondering what the hell happened to the slashdot community..

  165. Fuzzy Logic by Corpus_Callosum · · Score: 3, Interesting

    You're a relic, I'm afraid ;-) ... Binary operations can be carried out by considering whatever values you have to be binary numbers...

    Heh.. I hate to break this to you, but your thinking is a bit behind the times as well...

    Multivalued logic = Fuzzy logic

    The most common AND and OR operations in Fuzzy Logic are min() and max() that together form the basis of a De-Morgan Algrebra (only the law of excluded middle [A AND NOT A = 0, A OR NOT A = 1] must be thrown out)

    AND(A,B) = MIN(A,B)
    OR(A,B) = MAX(A,B)
    NOT(A) = 1-A
    Generally, a trenary logic is composed of { 0, 0.5, 1 } where each value is the "degree" or "belief" in TRUE.

    0 = FALSE
    0.5 = UNKNOWN
    1 = TRUE

    Some of you may recognize this from SQL (yes, SQL does actually have a simple trenary fuzzy logic base).

    The truth table ends up looking like this:

    0 AND 0 = 0
    0 AND 0.5 = 0
    0.5 AND 0.5 = 0.5
    0.5 AND 1 = 0.5
    1 AND 1 = 1

    0 OR 0 = 0
    0 OR 0.5 = 0.5
    0.5 OR 0.5 = 0.5
    0.5 OR 1 = 1
    1 OR 1 = 1

    NOT 0 =1
    NOT 0.5 = 0.5
    NOT 1 = 0

    If we move from trenary to any other precision, the rules stay the same and the table is easily derived ( min, max, 1- ). Generally, it is prefered to always have a 0.5 value, because UNKNOWN is actually a useful truth indicator. The next set after trenary that makes sense is not 4-value-logic (because it would exclude unknown), but instead 5. For instance:

    0 = FALSE
    1/4 = UNLIKELY
    1/2 = UNKNOWN
    3/4 = LIKELY
    1 = TRUE

    At this point, some truly interesting approximate reasoning is possible, although going to 15 values or (ideally) handling multivalue logic as analog until storage/retrieval would be much better. Approximate reasoning is one of the many things that fuzzy logic makes possible. Essentially it is the application of fuzzy logic to determining beliefs where certainty is not important (and in fact the lack of certainty is where the power of such a system comes from - being able to continue computing without full knowledge, only belief)...

    The idea of signals that are analog flying around on a semiconductor, instead of digital, yet time discreet in the same way as digital signals is quite interesting and could probably be done quite easily. Anyone have any ideas on how a min(A,B), max(A,B) and (1-A) operation might look on silicon?

    --
    The reason that it can be true that 1+1 > 2 is that very peculiar nonzero value of the + operator
    1. Re:Fuzzy Logic by Effugas · · Score: 1

      0 AND 0 = 0
      0 AND 0.5 = 0
      0.5 AND 0.5 = 0.5
      0.5 AND 1 = 0.5
      1 AND 1 = 1
      ------------------

      This is weighted asymmetrically -- 0 and 0.5 must be 0.5, or 0.5 and 1 can't be 0.5.

      --Dan

    2. Re:Fuzzy Logic by Corpus_Callosum · · Score: 1

      This is weighted asymmetrically -- 0 and 0.5 must be 0.5, or 0.5 and 1 can't be 0.5.

      Sorry, but no. There has been a tremendous amount of research done on this topic. The most common operator for AND in multivalued logic is min(a,b). This operator allows for a De-Morgan algebra (very similar to a Boolean algreba but with excluded middle blown out).

      With min(A,B), 0 AND 1/2 = 0, 1/2 AND 1 = 1/2...

      Tis the way it works, sorry it offends your sensibilities - just think that the confidence of a conjunction of two truths is the lowest confidence being conjuncted and the confidence of two truths being disjuncted is the highest of those values being disjuncted. It makes sense in terms of set theory as well (think unions and intersections).

      --
      The reason that it can be true that 1+1 > 2 is that very peculiar nonzero value of the + operator
    3. Re:Fuzzy Logic by Effugas · · Score: 1

      Alright, I can buy AND/OR -> min/max translation (particularly since it leads to correct results in the binary case), but I can't seem to find any writings on which De Morgan algebra you're referring to that uses this property. Linkage?

      --Dan

  166. Terminology by Corpus_Callosum · · Score: 1

    Even the terminology is bad. True, false, alpha. Ugh. If P is sort of true, then kind of do q.

    How about "If you are going fast then slow down?"

    slow down = apply breaks
    pressure on breaks =proportional to= belief in the assertion "going fast"

    The fact that fuzzy propositional logic allows us to take english sentances and break then down into logic with very few steps or translations is extremely impressive and flys in the face of your statement.

    In fact, terminology in possibility theory and it's ability to rationally handle the ambiguous or less then fully quantifiable is exactly it's strength.

    One last note: You don't need many uncertainty states to make a system like this useful. Although, certainly, the more you have the more precision is possible. I think 255 states is more than enough for common applications, including control systems for machinery and whatnot. A chip designed properly could probably combine multiple fbits to increase precision in the same way that bits are combined to create ints or floats.

    --
    The reason that it can be true that 1+1 > 2 is that very peculiar nonzero value of the + operator
    1. Re:Terminology by jethroT · · Score: 1
      255 states? You think you can fit 255 states in a 1V voltage range? Without state 221 and 222 getting mixed up? With lets say a 1Ghz clock and all the electrical fields and line reflections etc. influencing your signal?

      What you are proposing is similar to the good old analog computer, not a bad idea and for some sort of problems really useful, but not effective as a general-purpose machine. Research facilities have worked for years on fuzzy-processor and AFAIK they are used in some cases, but most of the time it's only a binary CPU emulating fuzzy logic. Great for some problems, not competitive for the rest. The news article is talking about logic with 3 or 4 states which is not enough for fuzzy logic and is IMHO too much hazzle for too small a reward.

    2. Re:Terminology by iendedi · · Score: 1

      255 states? You think you can fit 255 states in a 1V voltage range? Without state 221 and 222 getting mixed up? With lets say a 1Ghz clock and all the electrical fields and line reflections etc. influencing your signal?

      I know my comment wasn't entirely clear, but what I was trying to say is that combining multiple fbits to reach a precision of 255 states would be enough for most applications. I understand the issues associated with discreet voltage differences in silicon and agree. But the possibility of digitally clocked, analog signals allowing for a fuzzy-logic (De-Morgan Algreba) on silicon is interesting... Not binary. Not Analog. The real issue there would be AD to go back and forth to memory... Oh well.. maybe next century...

      --

      It is your personal duty to fight for what is right on a daily basis. Ignoring injustice is identical to approving
    3. Re:Terminology by jethroT · · Score: 1

      I would love to play with a machine like that. But I have heavy doubts that such a machine would be faster or smaller than a special purpose digital computer simulating fuzzy logic.

  167. DNA is base 4.. by adeyadey · · Score: 1

    DNA is base 4, so does that make the AMD "human being simulator chip" a bit easier to build?
    Hmm, I'll go and file that with the US patents office, they seem an easy touch at the mo.. :-)

    --
    "You lied to me! There is a Swansea!"
  168. The Human Brain Again by Databass · · Score: 2, Interesting

    I've started a rule of thumb whenever I see a slashdot article on the upper limits of computing. This rule is activated even more rapidly if I see the phrase "Moore's Law". The game is I simply say to myself "How does this compare to the human brain?"

    For example the poster for this article asked "Is the need to make do with the current fabrication technology enough to drive the move to multi-valued logic? Or will Moore's law continue without the need for doing more with less silica based real estate?"

    So we're wondering about the upper limits of processing operations and the power expenditure. Is the sky the limit? Will we have to use something besides binary? I saw some posts saying ternary logic wasn't very practical because more interconnection requires even MORE power.

    The human brain can peform on the order of perhaps trillions of operations per second.
    The human brain can do this with about 20 watts of electrical power provided chemically.

    NOT BAD!! So what logical circuitry does the brain use for this?

    Electrically, brain cells are either firing or not firing. 1 or 0. That sounds kind of like binary. But we also know that they connect with and are connected to 1000s of other neurons, which have a summing effect on whether they fire or not. That sounds more like a very large-base number system. So the brain sort of combines a manageble width with a large depth.

    Anyway I just wanted to chime in that when it comes to pondering alternate calculation methods like ternary math, we would do well to at least think about reverse engineering the human brain's logical circuitry. And when it comes to thinking about the upper limits of computing, we should remind ourselves that we are competing with (and losing to, for now) a glob of salty fat that still outperforms our sillicon processor equivilants by orders of magnitude with less energy. If the brain can do it, so can we.

    1. Re:The Human Brain Again by Zurk · · Score: 1

      err...yes. but consider this :
      the human brain evolved over 3 BILLION years. we're loosing to a machine thats been designed and built and improved over a period far exceeding our civilization. its not a glob of salty fat -- its a three billion year old machine. theres a difference.
      if the brain can do it, we may take another billion years to figure out how to do it. reverse engineering gives us a speedup -- but by how much ? and who is going to invest those trillions of dollars to reverse engineer the brains processing ability in these days of short term profits ?

  169. Logic versus storage by Cardbox · · Score: 1
    Logic is messy in bases >2, but not much chip area is usually taken by logic-- much more is taken by memory.

    Memory is a better candidate for base-N>2 than logic from the point of view of power consumption as well. If you have a picture of your mind of a typical CMOS arrangement with two transistors hanging between the power rails, one ON and one OFF, so that no current flows, it's true that a 3rd state would have to imply a flowing current. But most memory (from flash EPROM to DRAM) doesn't rely on the ON-ness or OFF-ness of transistors, it stores charge in a capacitor (DRAM) or on the other side of a tunnel barrier (EPROM). Stored charge just sits there, it doesn't flow, so no power gets wasted.

    Of course, for arithmetic, the only natural base is base 1 anyway!

  170. A good solution to the noise margins problems by JosiKlaki · · Score: 2, Funny

    Unary logic. Also solves the pesky problems of users making mistakes.

    --


    --
    Is that all there is to relationships -sex and robotics?
  171. Ternary logic won't happen: here's why... by Theovon · · Score: 1

    The main problem is that companies (like Synopsys and Cadence) have been working for decades on design tools that work with binary. Although 3-level may, theoretically, be faster and smaller, binary will beat it because the tools are so sophistocated. It would take a long time to develop ternary design tools, and no one's going to want to foot the bill to develop new tools on such a "radical" idea.

    Think about this: most interconnects only allow 90 degree turns. Using 45 degree turns would be a much less radical improvement. The idea was thought of long ago. The tools still don't do it. Why? Not worth the development effort to companies making millions from the status quo.

  172. ternary logic by Anonymous Coward · · Score: 0

    There have been ternary logic systems since the beginning... they're called women.

    In college we used to joke that men were binary.. yes & no and women were ternary.... yes, no, and maybe where maybe was either a yes or a no but you were never sure until you picked one.

  173. ENIAC Again? by gillbates · · Score: 1

    IIRC, ENIAC, one of the first computers, was a base 10 system. Problem was, though, that its design didn't scale well and it was notoriously difficult to program. This is what prompted John Von Neumann to design the modern computer using a binary architecture - the logic was simpler, and easier to implement.

    While I could see going to trinary, or possibly quaternary, it still won't solve the problem it is meant to addresses - with more states, the smallest stages of design will get larger. Which means that we will need even more silicon to achieve the same functionality. Here's an example:

    Say we want a range of 16 digits. With quaternary, we can represent that with 2 bit "positions"; with binary, 4. Problem is, for every position in a quaternary system, we could have 4 values, as opposed to 2 with binary. To differentiate between a 0 and 1 requires 1 comparator in a binary system, whereas to differentiate between 0, 1, 2, 3 requires 6 comparators in a quaternary system.* So for a four bit binary system, we need 4 comparators for a given circuit, but for a 2 bit quaternary system, we need (2 * 6) = 12 comparators. Both can represent the same range of digits, yet one requires three times the transistors of the other.

    People who talk about computing in other bases are forgetting the computer history that led to using binary.

    * To understand why, consider that to demultiplex a single binary digit requires a single voltage comparator - if the voltage is above a certain certain value it goes to one line, otherwise, the other. To demultiplex quaternary requires 6 comparators, as each line must be able to determine that the voltage is above a certain threshold, but below another. The 0 and 3 lines only require 1 comparator because they only have to satisfy that the voltage is below or above a certain threshold, but the 1 and 2 lines must differentiate a range of voltages.

    --
    The society for a thought-free internet welcomes you.
  174. Analog Computing by nurb432 · · Score: 1

    That's been around forever, why not just go back to it..

    Then toss in async logic.. and MECL construction.

    Zoooom!

    ok ok , I'm showing my age here..

    In all seriousness, use light instead of electricity, and use analog concepts..

    --
    ---- Booth was a patriot ----
  175. Re:Questions about hardware and tri- quat- computi by Anonymous Coward · · Score: 0

    its voltage. for binary its :
    +5V <- 1
    0V <-- 0

    for trinary its :
    +5V <- +1
    0V <- 0
    -5V <- -1

  176. So why not build a hybrid by Psyborgue · · Score: 1

    the arithmatic logic could be processed using greater than binary logic while it would do everything else in binary.

    maybe this is not feasable but i imagine such a setup would increase arithmatic performance quite a bit.

  177. Damned friends by Anonymous Coward · · Score: 0

    My half-mad friend was logged in to my machine, sorry... The last comment was from me, not him...

    -Corpus_Callosum

  178. Programming Go? by qtp · · Score: 1

    Terniary computing might allow a programming logic that can represent the possibilities in Go, as each possible point on the board is occupied by either white, black or neither (three possible states).

    To date, all of the Go playing computer programs are rather sorry at the game, and perhaps this is due in part to the either/or logic of binary computing (and the bias towards either/or thinking that humans tend to cling to).

    Has anyone here looked at the Go programming problem using terniary logic methods/tools?

    (has anyone here done any Go programming at all?)

    --
    Read, L
  179. Re:Quantum Computing? by mabhatter654 · · Score: 1

    How about a move to Quantum logic. Quantum logic would go back to atomic basics of absorbing and emmiting electrons. Doped silicon "flips" at exactly one point. It would be trivial to build multi-switch "transistors". The hard part would be figuring out what to do with them!

  180. Re:Just base 3 or 4? How about base pi, e, i, 1,.. by bar-agent · · Score: 1

    Didn't Kirk use that trick to blow up one o' those pesky planetary-control computers? (And of course he abandoned the now civilization-less natives.)

    --
    i'd hit it so hard, if you pulled me out you'd be the king of britain [bash.org]
  181. not on optical signals by misterpies · · Score: 1


    That may be true if you're restricted to measuring voltage of electrical signals. But it has no bearing on optical processing.

    In an optical processing, information can be encoded in the colour of the light. So rather than having laser on=1, laser off=0, a system could use red on=A, red off=B, blue on =C, blue off=D etc. Because it's optical, and optical signals don't interfere with each other, you don't need to worry about noise. Additionally there are now materials that can be used to modulate the frequency of light passing through them, which would allow the signal to be all-optical. With such a system being technologically feasible, it seems silly to restrict yourself to binary logic.

    --
    The author of this post asserts his moral rights.
    1. Re:not on optical signals by maraist · · Score: 1

      I have hardly any experience with light or worse chromatic computation; only what I've read on slashdot really. But two challenges immediately occur to me.

      1) Injecting multiple colors down the same fiber (wave-guide) at the same time will not allow all the colors to appear at the other end at the same time. There are non-linear impedences (attentuations and phase-shifts). So we're trading regions of stability and noise-rejection with the technological challenge of working with synchronizing multiple signals. It's actually the same problem as SCSI/IDE ribbons.. Manufacturers are going to serial buses to avoid this exact problem. But the serial bus is only a transport; not part of the computation.. So I don't know how well this problem maps into the low-level computation.

      2) There is the problem of processing in a purely chromatic space.. I've read rumors that various company's have achieved 100% light-based computation (especially useful in networking, to avoid transcieving the data). I'm not aware if their computation is monochromatic or not. I would agree, if this were indeed possible, then it would be remarkable. But again, I must bring up the plausibility of making a pure-light based system denser than a binary electric one. Just as with electric, unless you achieve a digit density of no less than $numDigVals or so times weaker, you're not gaining much. (though in the case of light computation, there is the possibility of faster computation or less power consumption / heat dessipation). And, again, I definitely acknowledge light-based computation has been extremely useful in communications, where latency is removed by not having to convert back and forth to electric at each repeater/router. But I push this into the fringe of specialization, just like electric modems.

      --
      -Michael
  182. Paraconsistent logic by Kardamon · · Score: 1

    Paraconsistent logic is logic that can handle inconsistencies. One way to implement this, is by having more than 2 truth values. For instance {0} for false, {1} for true, {} for undecided and {0,1} for the contradictions. Some interesting (IMHO) links about this are:
    http://plato.stanford.edu/entries/logic-para consis tent/
    http://www.bu.edu/wcp/Papers/Logi/LogiPavl. htm

    --
    -- Qu'est-ce que la propriété intellectuelle? It is thought control.