Abstract
In this commentary we list the main results obtained by A. N. Kolmogorov and his pupils and followers in the domain of algorithmic information theory.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. N. Kolmogorov, To the logical foundations of information theory and probability theory, Problemy Peredachy Informatsii 5,3 (1969), 3–7.
A. N. Kolmogorov, Three approaches to the definition of the notion of “amount of information”, Problemy Peredachy Informatsii 11 (1965), 3–11.
V. D. Goppa, Non-probabilistic mutual information without memory, Problemy Upravl. i Teorii Inform. 42 (1975), 97–102.
V. D. Goppa, Information of words (initial approximation–information without memory), Problemy Peredachy Informatsii 143 (1978), 3–17.
A. K. Zvonkin, A.L. Levin, Complexity of finite objects and the foundations of the notion of information and randomness by means of algorithm theory, Uspekhi Mat. Nauk 25,6 (1970), 85–127.
V. V. Vyugin, Algorithmic entropy (complexity) of finite objects and its application to the definition of randomness and amount of information, Semiotica i Informatica, vol. 16, Moscow, VINITI, 1981, pp. 14–43.
C. P. Schnorr, Optimal Godel numberings,In: Information processing 71: Proc. IFIP. Congr. 71. Lubljana 1 (1971), 56–58.
Schnorr C. P., Optimal enumerations and optmal Godel numberings, Math. Syst. Theory 82 (1975), 182–191.
V. A. Uspensky, A.L. Semyonov, Theory of algorithms: its main discoveries and applications, Novosibirsk: Computing Center of the Siberian Section of the Academy of Sciences of the USSR,part 1 (1982), 99–342.
P. Martin-Löf, The definition of random sequence, Inform. and Contr. 98 (1966), 602–619.
R. Mises von., Grundlagen der Wahrscheinlichkeitsrechnung,Math. Ztschr. Bd. 5 (1919,), S. 52–99.
R. Mises von., Wahrscheinlichkeit, Statistik und Wahrheit, Wien, J. Springer, 1928.
A. Church, On the concept of a random sequence, Bull. Amer. Math. Soc. 482 (1940), 130–135.
R. P. Daley, Minimal-program complexity of pseudorecursive and pseudorandom sequences, Math. Syst. Theory 9,1 (1975), 83–94.
A. N. Kolmogorov, On tables of random numbers, Sankhya. A 254 (1963), 369–376.
D. Loveland, A new interpretation of the von Mises concept of random sequence, Ztschr. math. Log. und Grundl. Math. Bd. 124 (1966), 279–284.
D. Loveland, The Kleene hierarchy classification of recursively random sequences, Trans. Amer. Math. Soc. 1253 (1966), 497–510.
A. Shen, The frequency approach to the definition of the notion of random sequence,Moscow VINITI 18 (1982), 14–42, Semiotica i Informatica.
L. A. Levin,On the notion of random sequence, Dokl. Akad. Nauk SSSR 212,3 (1973), 548–550.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shen, A.K. (1993). Algorithmic Information Theory. 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_16
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive