Abstract
At the beginning of the year of 1951, the 5th year student of the mechanics and mathematics department of Moscow State University V. A. Uspensky was given a page of typewritten text with the description of a certain abstract machine by his scientific advisor A. N. Kolmogorov. The states of this machine were one-dimensional topological complexes or, more precisely, complexes with certain additional information. This additional information consisted in the vertices of the complexes being supplied with functions with values in a preliminarily chosen finite set so that the complex turned out to be labeled (by values of this function). The formulation proposed by A. N. Kolmogorov had the following two goals:
-
1)
to give a mathematical definition of the notion of algorithm that would be as general as possible (so general that it would directly include all algorithms);
-
2)
to verify that even this more general definition does not lead to an extension of the class of computable functions which was already clearly understood by this time on the basis of previous narrower definitions (due to Turing, Post, Markov, and others) and which, if one limits oneself to functions, coincides with the class of partially recursive functions.
Preview
Unable to display preview. Download preview PDF.
References
V. M. Glushkov, Introduction to cybernetics, Academy of Sciences of the Ukrainian SSR publications, Kiev, 1964, pp. 324.
D. Yu. Grigoryev, Kolmogorov algorithms are stronger than Turing machines, Zap. Nauch. Seminarov LOMI, 60 (1976), 29–37.
A. N. Kolmogorov, On the notion of algorithm, Uspekhi Mat Nauk 8,4 (1953), 175–176.
A. N. Kolmogorov, Ya. M. Barzdin, On the realization of nets in three-dimensional space, Problemy Kibernetiki, 19 (1967), 261–268.
A. N. Kolmogorov, V. A. Uspensky, To the definition of algorithm, Uspekhi Mat. Nauk, 13, 4, (1958), 3–28.
M. V. Kubinets, Recognizing self-intersections of a plane trajectory by Kolmogorov algorithms, Zap. Nauch. Seminarov LOMI, 32 (1972), 35–44.
A. O. Slisenko, Complexity of problems in the theory of computations, Uspekhi Mat. Nauk, 36, 6, (1981), 21–103.
V. A. Uspensky, Algorithm, Great Soviet Encyclopaedia, 3rd Edition„ vol. 1, 1970, pp. 400–401.
V. A. Uspensky, Algorithm, Mathematical Encyclopaedia, vol. 1, 1977, pp. 202–206.
Aho A. V., Hoperoft J. E., Ullman J. D.,The design and analysis of computer algorithms Reading (Mass.) etc.: Addison-Wesley Publ. Co. (1974), X + 470.
A. Schönhage, Universelle Turing Speicherung, In: Automatentheorie und formale Sprachen/ Ede J. Dorr, G. Hotz. Mannheim, (1970), 369–383.
A. Schönhage, Storage modification machines, Soc. Industr. and Appl. Math. J. Comput., 9,3 (1980), 490–508.
Berlin etc.: Springer-Verl., (1981), 100–234 (Lect. Notes in Comput. Sci.; Vol. 122 ).
V. A. Uspensky, A. L. Semenov, Theory of algorithms: its main discoveries and application, A.gorithms in modern mathematics and its applications, vol. 1, Computational Center of the Siberian Section of the Academy of Sciences of the USSR„ Novosibirsk, 1982, pp. 99–342.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspenski, V.A., Semyonov, A.L. (1993). Kolmogorov’s Algorithms or Machines. In: Shiryayev, A.N. (eds) Selected Works of A. N. Kolmogorov. Mathematics and Its Applications, vol 27. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2973-4_21
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive