Mathematical Metaphysics of Randomness

Abstract We consider various mathematical refinements of the notion of randomness of an infinite sequence and relations between them. On the base of the game approach a new possible refinement of the notion of randomness is introduced — unpredictability. The case of finite sequences is also considered.

[1]  P. J. Cohen.  Set Theory and the Continuum Hypothesis , 1966 .

[2]  S. Kakutani.  On Equivalence of Infinite Product Measures , 1948 .

[3]  S. S. Wilks,et al.  Probability, statistics and truth , 1939 .

[4]  V. Uspenskii,et al.  Can an individual sequence of zeros and ones be random? Russian Math , 1990 .

[5]  P. Martin-Löf.  On the Notion of Randomness , 1970 .

[6]  Péter Gács,et al.  Every Sequence Is Reducible to a Random One , 1986, Inf. Control..

[7]  Alexei Semenov,et al.  Algorithms: Main Ideas and Applications , 1993 .

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

[9]  R. Mises.  Grundlagen der Wahrscheinlichkeitsrechnung , 1919 .

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

[11]  L. Levin,et al.  THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .

[12]  R. Mises,et al.  Wahrscheinlichkeit, Statistik und Wahrheit. , 1936 .

[13]  V. Uspensky.  Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity , 1992 .

[14]  Akiko Kino,et al.  Intuitionism and Proof Theory , 1970 .

[15]  Péter Gács,et al.  Exact Expressions for Some Randomness Tests , 1979, Math. Log. Q..

[16]  A. Kolmogorov,et al.  ALGORITHMS AND RANDOMNESS , 1988 .

[17]  A. Shiryayev.  On Tables of Random Numbers , 1993 .

[18]  Erhard Tornier,et al.  Grundlagen der Wahrscheinlichkeitsrechnung , 1933 .

[19]  Claus-Peter Schnorr,et al.  The process complexity and effective random tests. , 1972, STOC.

[20]  Osamu Watanabe,et al.  Kolmogorov Complexity and Computational Complexity , 2012, EATCS Monographs on Theoretical Computer Science.

[21]  P. Martin-Löf.  Notes on constructive mathematics , 1970 .

[22]  Meyer Dwass,et al.  Probability: theory and applications , 1970 .