Ternary computer

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Setun ternary computer designed by Nikolay Brusentsov in the Soviet Union

A ternary computer (also called trinary computer) is a computer that uses ternary logic (three possible values) instead of the more common binary logic (two possible values) in its calculations.

History[edit]

One early calculating machine, built by Thomas Fowler entirely from wood[1][2] in 1840, operated in balanced ternary.[1][2] The first modern, electronic ternary computer Setun was built in 1958 in the Soviet Union at the Moscow State University by Nikolay Brusentsov,[3][4] and it had notable advantages over the binary computers which eventually replaced it (such as lower electricity consumption and lower production cost).[3] In 1970 Brusentsov built an enhanced version of the computer, which he called Setun-70.[3] In the USA, the ternary computing emulator Ternac working on a binary machine was developed in 1973.

Balanced ternary[edit]

Main article: Balanced ternary

Ternary computing is commonly implemented in terms of balanced ternary, which uses the three digits −1, 0, and +1. The negative value of any balanced ternary digit can be obtained by replacing every + with a − and vice versa. It is easy to subtract a number by inverting the + and − digits and then using normal addition. Balanced ternary can express negative values as easily as positive ones, without the need for a leading negative sign as with decimal numbers. These advantages make some calculations more efficient in ternary than binary[citation needed].

I often reflect that had the Ternary instead of the binary Notation been adopted in the Infancy of Society, machines something like the present would long ere this have been common, as the transition from mental to mechanical calculation would have been so very obvious and simple.

The future[edit]

With the advent of mass-produced binary components for computers, ternary computers have diminished to a small footnote in the history of computing. However, ternary logic's elegance and efficiency is predicted by Donald Knuth to bring them back into development in the future.[5] One possible way this could happen is by combining an optical computer with the ternary logic system.[6] A ternary computer using fiber optics could use dark as 0 and two orthogonal polarizations of light as 1 and −1. IBM also reports infrequently on ternary computing topics (in its papers), but it is not actively engaged in it.[citation needed]

The Josephson junction has been proposed as a balanced ternary memory cell, using circulating superconducting currents, either clockwise, counterclockwise, or off. "The advantages of the proposed memory circuit are capability of high speed computation, low power consumption and very simple construction with less number of elements due to the ternary operation."[7]

In 2009, a ternary quantum computer was proposed which thus uses qutrits rather than qubits. When the number of basic states of quantum element is d, it is called qudit.[8]

Ternary computers in popular culture[edit]

In Robert A. Heinlein's novel Time Enough for Love, the sapient computers of Secundus, the planet on which part of the framing story is set, including Minerva, use an unbalanced ternary system. Minerva, in reporting a calculation result, says "three hundred forty one thousand six hundred forty... the original ternary readout is unit pair pair comma unit nil nil comma unit pair pair comma unit nil nil point nil".[9]

Virtual Adepts in Mage: The Ascension use ternary computers.

In the webcomic Schlock Mercenary (by Howard Tayler), every modern computer is a ternary computer. AIs use the extra digit as "maybe" in boolean (true/false) operations, thus having a much more intimate understanding of fuzzy logic than is possible with binary computers.

Further reading[edit]

Hunger, Francis: SETUN. An Inquiry into the Soviet Ternary Computer. Institut für Buchkunst Leipzig, 2008, ISBN 3-932865-48-0 (English, German)

See also[edit]

References[edit]

  1. ^ a b Thomas Fowler biography
  2. ^ a b Mark Glusker, David M. Hogan, Pamela Vass. "The Ternary Calculating Machine of Thomas Fowler," IEEE Annals of the History of Computing, vol. 27, no. 3, pp. 4-22, July-September 2005.
  3. ^ a b c Russian Virtual Computer Museum – Hall of Fame – Nikolay Petrovich Brusentsov, retrieved 2010-01-25.
  4. ^ Trogemann, Georg; Nitussov, Alexander Y.; Ernst, Wolfgang (2001), Computing in Russia: the history of computer devices and information technology revealed, Vieweg+Teubner Verlag, pp. 19, 55, 57, 91, 104–107, ISBN 978-3-528-05757-2 .
  5. ^ D.E. Knuth, The Art of Computer Programming – Volume 2: Seminumerical Algorithms, pp. 190–192. Addison-Wesley, 2nd ed., 1980. ISBN 0-201-03822-6.
  6. ^ Ternary Optical Computer
  7. ^ doi:10.1109/ISMVL.1998.679270
  8. ^ Qudits
  9. ^ Chapter "Variations on a Theme III: Domestic Problems", Berkley books 19th printing [1982] page 99
  10. ^ Ternary "flip-flap-flop"

External links[edit]