Setun

For the river, see Setun River.

Setun (Russian: Сетунь) 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 most modern ternary computer, using the balanced ternary numeral system and three-valued ternary logic instead of the two-valued binary logic prevalent in other computers. 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 and production was halted in 1965. The characteristic operating memory consisted of 162 trits (ternary bits) with an additional 1944 trits on magnetic drum (total of about 3.3 KB).[1] 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.[2] In 1970, a new model of the ternary computer, the Setun-70, was developed.[3]

Setun was named after the Setun River, which ends near Moscow University.

Dialog System for Structured Programming (DSSP)

DSSP (Dialog System for Structured Programming) is a programming language designed for Setun. It was created by students in the laboratory of Nikolay Brusentsov at the Computer Science department of the Moscow State University in 1980. The 32-bit version was created in 1989.

DSSP is similar to the Forth programming language; both are examples of stack-based languages.[4]

The underlying ideology of DSSP was to reduce the semantic gaps between the human interface and the computer system. One principle was that there should only be one language to control and use the computer. Another was the principle of "one word of text – one word of machine code". DSSP's structure stays very close to the actual machine. It uses reverse Polish notation, a stack-oriented form of calculation.

The first document in English regarding this obscure language distinguishes DSSP from Forth in the following manner: "DSSP was not invented. It was found. That is why DSSP has not versions, but only extensions. Forth is created by practice. DSSP is created by theory. But they are similar and it is a fact of great importance."[4]

See also

References

  1. ↑ "ЭВМ «Сетунь»". Russian Virtual Computer Museum (in Russian). Retrieved September 20, 2016.
  2. ↑ Brousentsov, N. P.; Maslov, S. P.; Ramil Alvarez, J.; Zhogolev, E.A. "Development of ternary computers at Moscow State University". Russian Virtual Computer Museum. Retrieved January 19, 2015.
  3. ↑ Müller, Hartmut (2007). Global scaling: die Basis ganzheitlicher Naturwissenschaft ; eine Dokumentation. Ehlers Verlag GmbH. pp. 144–. ISBN 978-3-934196-66-7.
  4. 1 2 DSSP & Forth : Compare And Analysis
Notes
  • Klimenko, Stanislav V.: Computer science in Russia: A personal view. IEEE Annals of the history of computing, v. 21, n. 3, 1999
  • Malinovski, B. N.: Istorija vychislitel’noj tekhniki v licakh. Kiev, 1995, (in Russian)
  • Žogolev, Y. A.: The order code and an interpretative system for the Setun computer. USSR Comp. Math. And Math. Physics (3), 1962, Oxford, Pergamon Press, pp. 563–578 (in English)
  • G. Trogemann, A. Y. Nitussov, W. Ernst (Hg.), Computing in Russia: The History of Computer Devices and Information Technology revealed. Vieweg Verlag, July 2001 (in English)
  • Hunger, Francis: SETUN. An Inquiry into the Soviet Ternary Computer. Institut für Buchkunst Leipzig, 2008, ISBN 3-932865-48-0 (Englisch, German)
  • Knuth, Donald (2006). Seminumerical Algorithms. The art of computer programming. 2 (3 ed.). Addison-Wesley. p. 208. ISBN 0-201-89684-2. 
  • Brusentsov, Nikolay Petrovich; Ramil Alvarez, José (2011). "Ternary Computers: The Setun and the Setun 70" (PDF). Perspectives on Soviet and Russian Computing: First IFIP WG 9.7 Conference, SoRuCom 2006, Petrozavodsk, Russia, July 3-7, 2006, Revised Selected Papers: 74–80. doi:10.1007/978-3-642-22816-2_10. ISSN 1868-4238. 

External links

This article is issued from Wikipedia - version of the 11/12/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.