Keywords
- Random Sequence
- Recursive Function
- Finite Sequence
- Russian Math
- Frequency Approach
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kolmogorov A.N. (1956), Theory of probability. (In the book "Mathematics, its contents, methods and meaning", Moscow).
Church A. (1940), On the concept of a random sequence, Bulletin of Amer. Math. Soc., 46, N 2, 130–135.
Kolmogorov A.N. (1963), On tables of random numbers, Sankhya, Ser.A, v.25, part 4, 369–376.
Shen' A. (1982), Frequency approach to the definition of notion of a random sequence, "Semiotika and Informatika", N 18, p. 14–42, Moscow, VINITI, (in Russian).
Loveland D. (1966), A new interpretation of the von Mises' concept of random sequence, Z.fur Math. Logic und Grundlagen der Math., Bd.12., H.4, 279–294.
Kolmogorov A.N. (1969), Towards a logical foundation of information theory and probability theory, Problems in the transmission of information, v.5,N3, p. 3–7 (in Russian).
Solomonoff R.J. (1964), A formal theory of inductive inference, Inform. and Control, v.7, N1, p. 1–22.
Martin-Löf P. (1966), Algorithms and Random Sequences, Univ. of Erlangen.
Martin-Löf P. (1966), The definition of Random Sequences, Inform. and Control,v.9, 6, 602–619.
Vjugin V.V., (1981), Algorithmic entropy (complexity) of finite objects andits application to the definition of randomness and quantity of information, "Semiotika and Informatika", 16, p.14–43 (in Russian).
Chaitin G. (1966), On the length of programs for computing finite binary sequences, J.ASM, v.13, N4, p.547–569.
Zvonkin A.K., Levin L.A. (1970), The complexity of finite objects and the development of concepts of information and randomness by means of the theory algorithms, Russian Math. Surveys, v.25, N6, p.83–124.
Kolmogorov A.N. (1983), Combinatorial basis of information theory and probability theory, Report on International Mathematical Congress, Nice 1970, Russian Math. Surveys, v.38, N4, (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolmogorov, A.N. (1983). On Logical Foundations of Probability Theory. In: Prokhorov, J.V., Itô, K. (eds) Probability Theory and Mathematical Statistics. Lecture Notes in Mathematics, vol 1021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072897
Download citation
DOI: https://doi.org/10.1007/BFb0072897
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12718-5
Online ISBN: 978-3-540-38701-5
eBook Packages: Springer Book Archive
