Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Durand, N. Vereshchagin (2004)
Kolmogorov-Loveland stochasticity for finite stringsInf. Process. Lett., 91
V. Uspensky, A. Shen (1996)
Relations between varieties of kolmogorov complexitiesMathematical systems theory, 29
M. Lambalgen (1987)
Von Mises' Definition of Random Sequences ReconsideredJ. Symb. Log., 52
A. Kolmogorov (1968)
Three approaches to the quantitative definition of informationInternational Journal of Computer Mathematics, 2
A. Kolmogorov (1998)
On Tables of Random Numbers (Reprinted from "Sankhya: The Indian Journal of Statistics", Series A, Vol. 25 Part 4, 1963)Theor. Comput. Sci., 207
(1960)
Veroyatnost’ i informatsiya
A. Shiryayev (1993)
On Tables of Random Numbers
A.N. Kolmogorov (1982)
Semiotika i informatika
A.N. Kolmogorov (1965)
Three Approaches to the Quantitative De_nition of InformationProbl. Peredachi Inf., 1
A. Muchnik, Alexei Semenov, V. Uspensky (1998)
Mathematical Metaphysics of RandomnessTheor. Comput. Sci., 207
In the first part of this article, we answer Kolmogorov's question (stated in 1963 in [1]) about exact conditions for the existence of random generators. Kolmogorov theory of complexity permits of a precise definition of the notion of randomness for an individual sequence. For infinite sequences, the property of randomness is a binary property, a sequence can be random or not. For finite sequences, we can solely speak about a continuous property, a measure of randomness. Is it possible to measure randomness of a sequence t by the extent to which the law of large numbers is satisfied in all subsequences of t obtained in an “admissible way”? The case of infinite sequences was studied in [2]. As a measure of randomness (or, more exactly, of nonrandomness) of a finite sequence, we consider the specific deficiency of randomness δ (Definition 5). In the second part of this paper, we prove that the function δ/ln(1/δ) characterizes the connections between randomness of a finite sequence and the extent to which the law of large numbers is satisfied.
Problems of Information Transmission – Springer Journals
Published: Oct 4, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.