Abstract
From the point of view of classical probability theory, the occurence of a given sequence of zeros and ones as the result of n tosses of a symmetric coin has probability 2−n. Nevertheless, the appearance of certain of these sequences (for example, the one consisting of only zeros or the sequence 010101...) seems rather strange to us and leads us to suspect that there is something wrong, while the appearance of others does not lead to such a reaction. In other words, some sequences seem less “random”than others, so one may try to classify finite sequences of zeros and ones according to their “degree of randomness”. This classification is the main topic of the article that we are commenting upon here.
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, On tables of random numbers,Sankhya A., 25, 4, (1963), 369–376; On tables of random numbers, Russian translation: 18 (1982), 3–13, Semiotika i Informatika, Moscow, VINITI.
A. N. Kolmogorov, Three approaches to the definition of the notion of “amount of information”, Problemy Peredachy Informatsii 1, 1 (1965) 3–11.
A. N. Kolmogorov, To the logical foundations of information theory and probability theory, Problemy Peredachy Informatsii, 5, 3 (1969), 3–7.
D. Loveland, A new interpretation of the von Mises concept of random sequence, Ztschr. math. Log und Grundl. Math. Bd$112, H. 4 (1966), S. 279–294.
D. Loveland, The Kleene hierarchy classification of recursively random sequences, Trans. Amer. Math. Soc., (1966,,vol. 125, 3 ), 497–510.
L. A. Levin, On the notion of random sequence, Dokl. Akad. Nauk SSSR, 212, 3, (1973), 548–550.
P. Martin-Löf, The definition of random sequence, Inform. and Contr., 9, 6, (1966), 602–619.
R. von Mises, Grundlagen der Wahrscheinlichkeitsrechnung., Math. Ztschr., bd. 5 (1919) S. 52–99.
R. von Mises, Wahrscheinlichkeit, Statistik und Wahrheit (1928), Wien: J. Springer.
V. A. Uspensky, A. L. Semenov, What are the gains of the theory of algorithms: basic developments connected with the concept of algorithm and with its application in mathematics. In: Algorithms in modern mathematics and computer science: Proc. Conf. Urgench (UzSSR), (1979.); Lect. Notes in Comput. Sci.; 122 (1981), 100–234, Berlin etc.: Springer-Verl..
A. Church, On the concept of a random sequence, Bull. Amer. Math. Soc., 48, 2 (1940), 130–135.
A. Shen, The frequency approach to the definition of the notion of random sequence, Semiotika i Informatika, vol. 18, 1982, pp. 14–42.
Editor information
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shen, A.S. (1993). Tables of Random Numbers. 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_18
Download citation
DOI: https://doi.org/10.1007/978-94-017-2973-4_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8456-9
Online ISBN: 978-94-017-2973-4
eBook Packages: Springer Book Archive