In the first part of this article, we answer Kolmogorov's question (stated in 1963 in ) 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 . 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
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud