Kolmogorov’s Complexity Conception of Probability

Kolmogorov's goal in proposing his complexity conception of probability was to provide a better foundation for the applications of probability (as opposed to the theory of probability; he believed that his 1933 axioms were suucient for the theory of probability). The complexity conception was a natural development of Kolmogorov's earlier frequentist conception combined with (a) his conviction that only nite data sequences are of any interest in the applications of probability, and (b) Turing's discovery of the universal computing device. Besides the complexity conception itself , its developments by Martin-LL of, Levin et al will be brieey discussed; I will also list some advantages and limitations of Kolmogorov's complexity conception and the algorithmic theory of randomness in general.

[1]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[2]  Andrei N. Kolmogorov,et al.  On Tables of Random Numbers (Reprinted from "Sankhya: The Indian Journal of Statistics", Series A, Vol. 25 Part 4, 1963) , 1998, Theor. Comput. Sci..

[3]  Andrei N. Kolmogorov,et al.  Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.

[4]  G. Shafer,et al.  Probability and Finance: It's Only a Game! , 2001 .

[5]  A. Kolmogoroff Grundbegriffe der Wahrscheinlichkeitsrechnung , 1933 .

[6]  V. Vovk On the concept of the Bernoulli property , 1986 .

[7]  E. Asarin Some Properties of Kolmogorov $\Delta$-Random Finite Sequences , 1988 .

[8]  A. Kolmogorov On Logical Foundations of Probability Theory , 1983 .

[9]  V. V'yugin On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds , 1988 .

[10]  Péter Gács Exact Expressions for some Randomness Tests , 1979, Theoretical Computer Science.

[11]  Alexander Gammerman,et al.  Machine-Learning Applications of Algorithmic Randomness , 1999, ICML.

[12]  A. Kolmogorov Three approaches to the quantitative definition of information , 1968 .

[13]  C. Schnorr Zufälligkeit und Wahrscheinlichkeit , 1971 .

[14]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[15]  A. N. Kolmogorov Combinatorial foundations of information theory and the calculus of probabilities , 1983 .

[16]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[17]  Jean-Luc Ville Étude critique de la notion de collectif , 1939 .

[18]  V. V'yugin,et al.  Effective Convergence in Probability and an Ergodic Theorem forIndividual Random Sequences , 1998 .

[19]  D. Freedman,et al.  Finite Exchangeable Sequences , 1980 .

[20]  A. Church On the concept of a random sequence , 1940 .