[{"@context":"http:\/\/schema.org\/","@type":"BlogPosting","@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/ternary-computer-wikipedia\/#BlogPosting","mainEntityOfPage":"https:\/\/wiki.edu.vn\/en\/wiki24\/ternary-computer-wikipedia\/","headline":"Ternary computer – Wikipedia","name":"Ternary computer – Wikipedia","description":"before-content-x4 Computer that uses ternary logic after-content-x4 A ternary computer, also called trinary computer, is one that uses ternary logic","datePublished":"2016-08-19","dateModified":"2016-08-19","author":{"@type":"Person","@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/author\/lordneo\/#Person","name":"lordneo","url":"https:\/\/wiki.edu.vn\/en\/wiki24\/author\/lordneo\/","image":{"@type":"ImageObject","@id":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","height":96,"width":96}},"publisher":{"@type":"Organization","name":"Enzyklop\u00e4die","logo":{"@type":"ImageObject","@id":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","url":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","width":600,"height":60}},"image":{"@type":"ImageObject","@id":"https:\/\/wikimedia.org\/api\/rest_v1\/media\/math\/render\/svg\/a8354ff01787b7b2b1f76879d4163d9d186c4782","url":"https:\/\/wikimedia.org\/api\/rest_v1\/media\/math\/render\/svg\/a8354ff01787b7b2b1f76879d4163d9d186c4782","height":"","width":""},"url":"https:\/\/wiki.edu.vn\/en\/wiki24\/ternary-computer-wikipedia\/","about":["Wiki"],"wordCount":4264,"articleBody":"     (adsbygoogle = window.adsbygoogle || []).push({});before-content-x4Computer that uses ternary logic       (adsbygoogle = window.adsbygoogle || []).push({});after-content-x4A ternary computer, also called trinary computer, is one that uses ternary logic (i.e., base 3) instead of the more common binary system (i.e., base 2) in its calculations. This means it uses trits (instead of bits, as most computers do).Table of Contents       (adsbygoogle = window.adsbygoogle || []).push({});after-content-x4Types of states[edit]History[edit]Balanced ternary[edit]Unbalanced ternary[edit]Potential future applications[edit]In popular culture[edit]See also[edit]References[edit]Further reading[edit]External links[edit]Types of states[edit]Ternary computing deals with three discrete states, but the ternary digits themselves can be defined differently:[1]SystemStatesUnbalanced ternary012Fractional unbalanced ternary01\u204421Balanced ternary\u2212101Unknown-state logicF?TTernary-coded binaryTFTTernary quantum computers use qutrits rather than trits. A qutrit is a quantum state that is a complex unit vector in three dimensions, which can be written as |\u03a8\u27e9=\u03b1|0\u27e9+\u03b2|1\u27e9+\u03b3|2\u27e9{displaystyle |Psi rangle =alpha |0rangle +beta |1rangle +gamma |2rangle } in the bra-ket notation.[2] The labels given to the basis vectors (|0\u27e9,|1\u27e9,|2\u27e9{displaystyle |0rangle ,|1rangle ,|2rangle }) can be replaced with other labels, for example those given above.       (adsbygoogle = window.adsbygoogle || []).push({});after-content-x4History[edit]I often reflect that had the Ternary instead of the denary 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.One early calculating machine, built entirely from wood by Thomas Fowler in 1840, operated in balanced ternary.[4][5][3] The first modern, electronic ternary computer, Setun, was built in 1958 in the Soviet Union at the Moscow State University by Nikolay Brusentsov,[6][7] and it had notable advantages over the binary computers that eventually replaced it, such as lower electricity consumption and lower production cost.[6] In 1970 Brusentsov built an enhanced version of the computer, which he called Setun-70.[6]  In the United States, the ternary computing emulator Ternac working on a binary machine was developed in 1973.[8]:\u200a22\u200aThe ternary computer QTC-1 was developed in Canada.[9]Balanced ternary[edit]Ternary computing is commonly implemented in terms of balanced ternary, which uses the three digits \u22121, 0, and +1. The negative value of any balanced ternary digit can be obtained by replacing every + with a \u2212 and vice versa. It is easy to subtract a number by inverting the + and \u2212 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 unbalanced numbers. These advantages make some calculations more efficient in ternary than binary.[10] Considering that digit signs are mandatory, and nonzero digits are magnitude 1 only, notation that drops the ‘1’s and use only zero and the + \u2212 signs is more concise than if 1’s are included.Unbalanced ternary[edit]Ternary computing can be implemented in terms of unbalanced ternary, which uses the three digits 0, 1, 2. The original 0 and 1 are explained as an ordinary binary computer, but instead uses 2 as leakage current.The world’s first unbalanced ternary semiconductor design on a large wafer was implemented by the research team led by Kim Kyung-rok at Ulsan National Institute of Science and Technology in South Korea, which will help development of low power and high computing microchips in the future. This research theme was selected as one of the future projects funded by Samsung in 2017, published on July 15, 2019.[11]Potential future applications[edit]With the advent of mass-produced binary components for computers, ternary computers have diminished in significance. However, Donald Knuth argues that they will be brought back into development in the future to take advantage of ternary logic’s elegance and efficiency.[10] One possible way this could happen is by combining an optical computer with the ternary logic system.[12] A ternary computer using fiber optics could use dark as 0 and two orthogonal polarizations of light as +1 and \u22121.[13]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 fewer elements due to the ternary operation.”[14]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”.[15]See also[edit]References[edit]^ Connelly, Jeff (2008). “Ternary Computing Testbed 3-Trit Computer Architecture” (PDF). California Polytechnic State University of San Luis Obispo.^ Colin P. Williams (2011). Explorations in Quantum Computing. Springer. pp.\u00a022\u201323. ISBN\u00a0978-1-84628-887-6.^ a b Hayes, Brian (2008-04-01). Group Theory in the Bedroom, and Other Mathematical Diversions. Farrar, Straus and Giroux. ISBN\u00a0978-1-4299-3857-0.^ McKay, John; Vass, Pamela. “Thomas Fowler”. Archived from the original on 31 May 2007.^ Glusker, Mark; Hogan, David M.; Vass, Pamela (July\u2013September 2005). “The Ternary Calculating Machine of Thomas Fowler”. IEEE Annals of the History of Computing. 27 (3): 4\u201322. doi:10.1109\/mahc.2005.49.^ a b c Nitusov, Alexander. “Nikolay Petrovich Brusentsov”. Russian Virtual Computer Museum: Hall of Fame. Retrieved 25 January 2010.^ Trogemann, Georg; Nitussov, Alexander Y.; Ernst, Wolfgang (2001). Computing in Russia: the history of computer devices and information technology revealed. Vieweg+Teubner Verlag. pp.\u00a019, 55, 57, 91, 104\u2013107. ISBN\u00a0978-3-528-05757-2..^ Epstein, George; Frieder, Gideon; Rine, David C. (1974). “The development of multiple-valued logic as related to computer science”. Computer. IEEE. 7 (9): 20\u201332. doi:10.1109\/MC.1974.6323304. eISSN\u00a01558-0814. ISSN\u00a00018-9162. S2CID\u00a030527807.^ Cho, Y. H.; Mouftah, H. T. (1988). A CMOS ternary ROM chip (PDF). Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic. IEEE. pp.\u00a0358\u2013363. doi:10.1109\/ISMVL.1988.5195. ISBN\u00a00-8186-0859-5.^ a b Knuth, Donald (1980). The Art of Computer Programming. Vol.\u00a02: Seminumerical Algorithms (2nd\u00a0ed.). Addison-Wesley. pp.\u00a0190\u2013192. ISBN\u00a00-201-03822-6..^ “S. Korean researchers develop world’s first ternary semiconductor tech”. Maeil Business Newspaper. 17 July 2019.^ Jin Yi; He Huacan; L\u00fc Yangtian (2005). “Ternary Optical Computer Architecture”. Physica Scripta. T118: 98. Bibcode:2005PhST..118…98Y. doi:10.1238\/Physica.Topical.118a00098.^ Jin, Yi (2003). “Ternary optical computer principle”. Science in China Series F. 46 (2): 145. doi:10.1360\/03yf9012. ISSN\u00a01009-2757. S2CID\u00a035306726.^ Morisue, M.; Endo, J.; Morooka, T.; Shimizu, N.; Sakamoto, M. (1998). “A Josephson ternary memory circuit”. Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138): 19\u201324. doi:10.1109\/ISMVL.1998.679270. ISBN\u00a0978-0-8186-8371-8. S2CID\u00a019998395.^ Heinlein, Robert A. (1982). “Variations on a Theme III: Domestic Problems”. Time Enough for Love. Berkley Books. p.\u00a099. ISBN\u00a0978-0-399-11151-8.Further reading[edit]External links[edit]     (adsbygoogle = window.adsbygoogle || []).push({});after-content-x4"},{"@context":"http:\/\/schema.org\/","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/#breadcrumbitem","name":"Enzyklop\u00e4die"}},{"@type":"ListItem","position":2,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/ternary-computer-wikipedia\/#breadcrumbitem","name":"Ternary computer – Wikipedia"}}]}]