View source for Setun

{{Short description|Soviet ternary computer}}
{{for|the river in Russia|Setun (river)}}
{{Infobox information appliance
| name         = Setun
| image        = File:Setun computer, from Sputnik in 1959.png
| image_size   = 
| alt          = 
| caption      = A photo of a Setun computer in 1959.
| aka          = 
| developer    = [[Sergei Sobolev]] and [[Nikolay Brusentsov]] at [[Moscow State University]]
| manufacturer = [[Kazan]] Mathematical plant
| type         = 
| releasedate  = {{Start date and age|1959}}
| price        = 
| connectivity = 
| lifespan     = 1959–1965
| unitssold    = 50
| media        = 
| os           = <!-- operating system -->
| input        = 
| camera       = 
| power        = 
| cpu          = 
| CPUspeed     = 
| storage      = 
| memory       = 
| RAMtype      = 
| display      = 
| audio        = 
| service      = <!-- online service/s offered -->
| dimensions   = 
| weight       = 
| touchpad     = 
| predecessor  = 
| successor    = [[Setun-70]]
| related      =
}}
'''Setun'''  ({{langx|ru|Сетунь}}) was a computer developed in 1958 at [[Moscow State University]]. It was built under the leadership of [[Sergei Sobolev]] and [[Nikolay Brusentsov]]. It was the first modern [[ternary computer]], using the [[balanced ternary]] numeral system and three-valued [[ternary logic]] instead of the two-valued [[binary numeral system|binary]] logic prevalent in other computers.<ref name="cabinet">{{Cite web|url=https://cabinetmagazine.org/issues/65/weatherby.php|title=Hegel 2.0 &#124; Leif Weatherby|first=Leif|last=Weatherby|website=cabinetmagazine.org}}</ref><ref name="dataart">{{Cite web|url=https://museum.dataart.com/ru/history/glava-2-kiberraznoobrazie/|title=Глава 2. Киберразнообразие|website=DataArt IT Museum}}</ref><ref name="earl">{{Cite web|url=https://earltcampbell.com/2014/12/29/the-setun-computer/|title=The Setun Computer|date=December 29, 2014}}</ref>

==Overview==
The computer was built to fulfill the needs of Moscow State University. It was manufactured at the [[Kazan]] Mathematical plant. Fifty computers were built from 1959 until 1965, when production was halted. The characteristic operating memory consisted of 81 words of memory, each word composed of 18 [[Ternary numeral system|trits]] (ternary digits) with additional 1944 words on [[Drum memory|magnetic drum]] (total of about 7&nbsp;KB).<ref>{{cite web|url=https://www.computer-museum.ru/articles/setun-i-setun-70/|title=ЭВМ ''Сетунь''|last=|first=|date=|website=Russian Virtual Computer Museum|language=Russian|trans-title=''Setun'' computer|archive-url=|archive-date=|access-date=September 20, 2016}}</ref> Between 1965 and 1970, a regular binary computer was used at Moscow State University to replace it. Although this replacement binary computer performed equally well, it was 2.5 times the cost of the Setun.<ref name="Brousentsov">{{cite web |url=https://www.computer-museum.ru/english/setun.htm |title=Development of ternary computers at Moscow State University |last1=Brousentsov |first1= N. P. |last2=Maslov |first2= S. P. |last3=Ramil Alvarez |first3=J. |last4=Zhogolev |first4= E. A. |website=Russian Virtual Computer Museum |accessdate=January 19, 2015}}</ref>

In 1970, a new ternary computer architecture, the [[Setun-70]], was developed. [[Edsger W. Dijkstra]]'s ideas of [[structured programming]] were implemented in the hardware of this computer. The short instructions set was developed and implemented by [[Nikolay Brusentsov]] independently from [[Reduced instruction set computer|RISC architecture]] principles.<ref name="Brousentsov"/>

The Setun-70 hardware architecture was transformed into the Dialogue System of Structured Programming (DSSP). DSSP emulates the "Setun 70" architecture on binary computers, thus it fulfills the advantages of structured programming. DSSP programming language has similar syntax to the [[Forth (programming language)|Forth]] programming language but has a different sequence of base instructions, especially conditional jump instructions. DSSP was developed by Nikolay Brusentsov and doctoral students in the 1980s at [[Moscow State University]]. A 32-bit version was implemented in 1989.

== History ==

=== Initiation of the project ===
The Setun project was initiated by [[Sergei Sobolev]], in order to develop a small computer for use at the [[Moscow State University]], after the planned transfer of the M-2 computer to the university got canceled in 1953. In 1956, he organized a series of seminars analyzing the disadvantages of existing computers and various plans for technical implementation. These meetings included participants from the Moscow State University, the Institute of Atomic Energy, and other institutes of the Academy of Sciences. Notable attendees include Shura-Bura, Konstantin Adolfovich Semendaev, and Zhogolev. On one of these seminars on April 23, 1956, [[Nikolay Brusentsov|Nikolay Petrovich Brusentsov]] was appointed as the executive designer and supervisor of the project.<ref name=":0">{{Cite web |title=Pioneers of Soviet Computing {{!}} SIGCIS |url=https://www.sigcis.org/malinovsky_pioneers |access-date=2025-05-26 |website=www.sigcis.org}}</ref><ref>{{Cite book |last=Prokhorov |first=Sergei |chapter=Sergei Sobolev - the eminent mathematician, founder of Russian computer science |date=June 2020 |title=2020 International Conference Engineering Technologies and Computer Science (EnT) |publisher=IEEE |pages=104–108 |doi=10.1109/EnT48576.2020.00026 |isbn=978-1-7281-8090-8}}</ref>

At the time, Brusentsov was a graduate (equivalent to a master degree, see [[Education in Russia]], traditional model) at Moscow State University, who was graduated from the [[Moscow Power Engineering Institute|Moscow Energy Institute]]. Before appointing Brusentsov as the executive designer of Setun computer, Sobolev transferred Brusentsov to the Mechanics-Mathematics department and sent him to Gutenmakher's laboratory at the Institute for Precision Mechanics to gain relevant experience. To Brusentsov, this was an invaluable experience. In the lab, he had access to the lab's computers and their supporting documentation, which Brusentsov found being "technically weak". Brusentsov then decided to use a ternary number system.

=== Setun computer ===
Sobolev continued to support the project both by finding assistants and participating in the discussions. In 1956, Brusentsov started the design with four engineers and five technicians plus himself. The whole team worked in a 60-square-meter room with laboratory tables, where they designed and assembled the machine by hand. Zhogolev worked as the main programmer, and together with him, Brusentsov developed the computer architecture of Setun. In 1958, the team grew to 20 people, and the first model of the Setun computer was assembled. The name Setun comes from a river near the University.<ref name="Brousentsov" /><ref name=":0" />

After the first model of Setun was built, the [[Kazan Mathematical Machines Factory]] was decreed by the Soviet Cabinet of Ministers to mass-produce the Setun computers. However, the leadership at the Kazan plant was not interested in large-scale computer production. The second model built in the factory was sent back because the plant managers and officials maintained that the computer was not yet reliable. The team was forced to manually adjust the second model. On November 30, 1961, the director of the Kazan factory was forced to sign an act which ended the attempts to cease the production of the Setun computer. The computers were then produced at the rate of 15-20 machines annually until 1965, when the plant refused to continue the production as the sale price of the computer was too low.

While Setun attracted significant interest from abroad, the Ministry of Foreign Trade never filled the orders received. Only 50 Setun computers have been manufactured, 30 of which were used in the higher education institutions inside the Soviet Union.<ref name="Brousentsov" /><ref name=":0" />

=== Setun-70 computer ===
Between 1961 and 1968, Brusentsov and Zhogolev developed Setun-70, the next generation of Setun computer with a new architecture. It was designed for effective software development, in which the ternary system played a key role.  Both addresses and operations are in syllables, where each syllable's length equals to 6 trits (about 9.5 bits). Algebraic expressions of operands by syllables replace the instructions as words in the traditional design, as the instruction set is updated to allow more variance of operand length.<ref name="Brousentsov" /> The algebra is supplemented by testing, control, and input-output operations. The user can add operations on their own without reducing the computer's performance, thus providing the ideal conditions for structured programming. Brusentsov claimed that the programming time on Setun-70 is reduced by five to tenfold with unprecedented reliability, clarity, compactness and speed.

The functioning algorithm of Setun-70 was comprehensively described in expanded [[ALGOL 60|Algol-60]].

=== End of the Setun project ===
The new university rector considered Brusentsov's research and computer design a [[Pseudoscience|pseudo-science]]. After the Setun-70 project, Brusentsov's lab was relocated from the computer center at Moscow State University to an attic in a student dormitory, and the original prototype of the Setun computer was destroyed. The Setun-70 model was taken to the new attic laboratory and was used as a basis for developing the educational computer system Master Work Station.

== Adoption and application ==
Thanks to the simplicity and naturalness of its architecture, as well as a well-designed programming system that included the following interpreters—IP-2 (floating-point, 8 decimal digits), IP-3 (floating-point, 6 decimal digits), IP-4 (complex numbers, 8 decimal digits), IP-5 (floating-point, 12 decimal digits)—plus the POLIZ autocode with its operating system and standard subroutine library (floating-point, 6 decimal digits), the Setun computers were quickly mastered by users in universities, industrial plants, and research institutes. They proved to be an effective tool for solving practically important problems across a wide range of fields, from scientific modeling and engineering calculations to weather forecasting and enterprise management optimization.<ref>{{Cite journal |last=Брусенцов |first=Н.П. |date=1972 |title=Электромагнитные цифровые устройства с однопроводной передачей трехзначных сигналов. |journal=[[Nauka (journal)|Наука]] |pages=242–244}}</ref>

At user seminars on the Setun computers—held at Moscow State University (1965), the Lyudinovo Diesel-Locomotive Plant (1968), and Irkutsk Polytechnic Institute (1969)—dozens of reports were presented on successful real-world applications for the national economy. Owing to its balanced ternary code, Setun turned out to be a truly universal, easily programmable, and highly efficient computing instrument. It earned a strong reputation, notably as an educational tool for teaching computational mathematics in more than thirty universities. At the Zhukovsky Air Force Engineering Academy, Setun even became the platform for the first automated computer-based learning system.<ref>{{Cite web |title=Троичные ЭВМ "Сетунь" и "Сетунь 70" |url=https://www.computer-museum.ru/histussr/setun_b.htm |access-date=2025-05-27 |website=www.computer-museum.ru}}</ref>

== Critics ==
[[Brian Hayes (scientist)|Brian Hayes]] argues in his article ''Third Base'' that Brusentsov did not realize the theoretical advantage of the base 3 system:<ref>{{Cite journal |last=Hayes |first=Brian |date=2001 |title=Computing Science: Third Base |url=https://www.jstor.org/stable/27857554 |journal=American Scientist |volume=89 |issue=6 |pages=490–494 |doi=10.1511/2001.40.490 |jstor=27857554 |issn=0003-0996}}</ref>{{blockquote|Unfortunately, Setun did not realize the potential of base 3 to reduce component counts. Each trit was stored in a pair of magnetic cores, wired in tandem so that they had three stable states. A pair of cores could have held two binary bits, which amounts to more information than a single trit, and so the ternary advantage was squandered.}}

== Ternary compared to binary ==
[[Balanced ternary|Balanced ternary systems]] and ternary computers are not unprecedented in history. Thomas Fowler built a mechanical computer in 1840 using balanced ternary system.<ref name="tf1">{{cite web |last1=McKay |first1=John |last2=Vass |first2=Pamela |title=Thomas Fowler |url=http://myweb.tiscali.co.uk/torrington/fowler.htm |url-status=dead |archiveurl=https://web.archive.org/web/20070531221517/http://myweb.tiscali.co.uk/torrington/fowler.htm |archivedate=31 May 2007}}</ref> The balanced ternary representation of numbers and its related arithmetics was applied in number theory back to [[Leonhard Euler]]<ref>{{cite journal |last=Andrews |first=George E. |year=2007 |title=Euler's "De Partitio numerorum" |journal=Bulletin of the American Mathematical Society |series=New Series |volume=44 |issue=4 |pages=561–573 |doi=10.1090/S0273-0979-07-01180-9 |mr=2338365 |doi-access=free}}</ref> and was briefly discussed by [[Claude Shannon]] in his paper ''a symmetric notation of numbers'' published in 1950.<ref>{{Cite journal |last=Shannon |first=C. E. |date=February 1950 |title=A Symmetrical Notation for Numbers |url=https://doi.org/10.1080/00029890.1950.11999490 |journal=The American Mathematical Monthly |volume=57 |issue=2 |pages=90–93 |doi=10.1080/00029890.1950.11999490 |issn=0002-9890|url-access=subscription }}</ref>

Despite the ternary design never becoming massively produced, there have been discussions on the advantages of the ternary system over the binary system, and great interest was present on the ternary and more generally on the multi-valued logic systems in the academy.<ref>{{Cite conference |last1=Dubrova |first1=Elena |title=Multiple-Valued Logic in VLSI: Challenges and Opportunities |url=https://www.semanticscholar.org/paper/Multiple-Valued-Logic-in-VLSI:-Challenges-and-Dubrova/66d9ec85f74a953b3aa0b17758a306ce5035d29a |access-date=2025-05-27 |s2cid=17070721 }}</ref>

=== Advantages ===
Brusentsov found the ternary number system superior to the binary number system: it allowed him to create very simple and reliable elements, and he needed seven times fewer elements than the Gutenmakher's computers. The power source requirements were also significantly reduced because a smaller amount of magnetic rods and diodes was used. He also found the natural number-coding system used in the ternary system superior over the direct, reciprocal and supplementary number coding used in the binary system. He maintained that the ternary system is superior to binary in most aspects and published several papers advocating the ternary system from 1985 to 2014.

The symmetric nature of balanced ternary logic allows for natural representation of negative numbers.

The ternary system is also more efficient from an [[information theory]] perspective. [[Donald Knuth]] wrote in his book ''The art of Computer Programming'' that "Perhaps the symmetric properties and simple arithmetic of this number system will prove to be quite important some day,"<ref name="Knuth">{{Cite book |last=Knuth |first=Donald |title=The art of Computer Programming |publisher=Addison-Wesley |year=1997 |isbn=0-201-89684-2 |volume=2 |pages=195–213 |authorlink=Donald Knuth}}</ref> noting that,{{blockquote|The complexity of arithmetic circuitry for balanced ternary arithmetic is not much greater than it is for the binary system, and a given number requires only <math>\log_3 2 \approx 63 \%</math> as many digit positions for its representation."<ref name="Knuth"/>}}In the paper ''The Prospects for Multivalued Logic: A Technology and Applications View'', [[Kenneth C. Smith]] argued that multi-valued logic is a solution to the interconnection problem in digital systems.<ref>{{Cite journal |last=Smith |date=September 1981 |title=The Prospects for Multivalued Logic: A Technology and Applications View |url=https://doi.org/10.1109/tc.1981.1675860 |journal=IEEE Transactions on Computers |volume=C-30 |issue=9 |pages=619–634 |doi=10.1109/tc.1981.1675860 |bibcode=1981ITCmp.100..619S |issn=0018-9340|url-access=subscription }}</ref> In particular, [[Douglas W. Jones]] suggests that the ternary system will reduce the number of interconnection wires by 36%<ref name="Jones">{{Cite web |last=Jones |first=Douglas |date=April 1, 2012 |title=Douglas W. Jones on Ternary Computing |url=https://homepage.cs.uiowa.edu/~jones/ternary/ |access-date=2025-05-27 |website=homepage.cs.uiowa.edu}}</ref>

=== Disadvantages ===
Douglas W. Jones made a series of computations and designs algorithms of ternary system on his homepage under the name ''The Ternary Manifesto'', including fast ternary addition, multiplication, and division. It turns out that much of the improved efficiency in the interconnection and digit representation is balanced out by requiring more gates in the computations. For example, the ternary addition, while achieving the same computational speed as binary addition, requires 62% more logic.'''<ref name="Jones"/>'''

Meanwhile, many have suggested that ternary circuits are hard to develop, especially when most modern digital flows are binary.<ref name=":1">{{Cite journal |last1=Etiemble |first1=D. |last2=Israel |first2=M. |date=April 1988 |title=Comparison of binary and multivalued ICs according to VLSI criteria |url=https://doi.org/10.1109/2.49 |journal=Computer |volume=21 |issue=4 |pages=28–42 |doi=10.1109/2.49 |bibcode=1988Compr..21d..28E |issn=0018-9162|url-access=subscription }}</ref><ref>{{Cite journal |last1=Nair |first1=Ravi |last2=Smith |first2=Scott |last3=Di |first3=Jia |date=2015-09-11 |title=Delay Insensitive Ternary CMOS Logic for Secure Hardware |journal=Journal of Low Power Electronics and Applications |language=en |volume=5 |issue=3 |pages=183–215 |doi=10.3390/jlpea5030183 |doi-access=free |issn=2079-9268}}</ref>

In the paper ''Comparison of Binary and Multivalued ICs According to VLSI Criteria'' written by Daniel Etiemble & Michel Israël, the authors compared binary and multivalued integrated circuits by examining their performance in detail, and discovered that while the design of multivalued circuits are valid and useful, they have not surpassed the binary circuits. They wrote in the conclusion that <ref name=":1" />{{blockquote|Multi-valued circuits and two-valued circuits must not
be seen as competitors. If they are seen as such, then two-valued circuits have already won.}}

== See also ==

* [[History of computing in the Soviet Union]]

==References==
{{Reflist}}

{{List of Russian microprocessors}}
{{List of Soviet computer systems}}

[[Category:Early computers]]
[[Category:Soviet computer systems]]
[[Category:Soviet inventions]]