Abstract
I should like to begin with some considerations which go beyond the framework of the main topic of my report. Mathematics formalized according to Hilbert is nothing other than the theory of operations on schemes of special form consisting of a finite number of symbols disposed in a certain order and related by various connections. For example, according to N. Bourbaki’s approach, the entire theory of sets studies only expressions consisting of the signs
and “letters” which are related by “links” [diagram 1] as for example in the expression called.
Uspekhi Mat. Nauk, 1983, vol. 38, vyp. 4, p. 27–36.
The text being published was prepared in 1970 in connection with my report at the International Mathematical Congress in Nice.
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, Three approaches to the definition of the notion of “amount of information”, Problemy Peredachy Informatsii(in Russian) 1,1, (1965), 3–11.
A. N. Kolmogorov, Logical basis for information theory and probability theory, IEEE Trans. Inform. Theory IT-14 (1968), 662–664.
R. L. Solomonoff, A formal theory of inductive inference, Inform. and Contr. 7,1 (1964), 1–22.
G. Chaitin, On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13,4 (1966), 547–569.
D. Loveland, A new interpretation of the von Mises concept of random sequence, Ztschr. math. Log. und Grundl. Math. 12 (1966), 279–294.
A. Church, On the concept of a random sequence, Bull. Amer. Math. Soc. 48 (1940), 130–135.
P. Martin-Löf, The definition of random sequences, Inform. and Contr. 9,6 (1966), 602–619.
P. Martin-Löf, Algorithms and random sequences, Erlangen, Univ. Press, 1966.
C. P. Schnorr, Ein Bemerkung zum Bergiff der zufalligen Folge,Ztschr. Wahrscheinlichkeitstheor. verw. Geb. 14 (1969,), 27–35.
B. A. Trakhtembrot, Complexity of algorithms and computations, Novosibirsk, Nauka, 1967.
A. N. Kolmogorov, V. A. Uspensky, To the definition of algorithm,Uspekhi Mat. Nauk 13,4 (1958), 3–28.
Ya. M. Barzdin, Universality problems in the theory of growing automata, Dokl. Akad. Nauk SSSR 157,3 (1964), 542–545.
Yu. P. Ofman, A universal automaton, Trudy Mosk. Mat. Obshchestvo 14 (1965), 186–199.
Yu. P. Ofman, Modelling self-constructing systems on the universal automaton, Problemy Peredachy Informatsii 2,1 (1966), 68–73.
Ya. M. Barzdin, Complexity of programs, determining if a natural number no greater than n belongs to a given recursively ennumerable set, Dokl. Akad. Nauk SSSR 182, 8 (1968), 1249–1252.
A. R. Zvonkin, L. A. L.vin, Complexity of objects and the foundation of the notions of information and randomness by means of the theory of algorithms, Uspekhi Mat. Nauk 25,6 (1970), 85–127.
A. N. Kolmogorov, On tables of random numbers, Sankhya. A 25,4 (1963), 369–376.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shiryayev, A.N. (1993). The Combinatorial Foundations of Information Theory and the Probability Calculus. 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_13
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive