Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the Role of the Law of Large Numbers in the Theory of Randomness

On the Role of the Law of Large Numbers in the Theory of Randomness 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

On the Role of the Law of Large Numbers in the Theory of Randomness

Loading next page...
 
/lp/springer_journal/on-the-role-of-the-law-of-large-numbers-in-the-theory-of-randomness-HZkoXtmGGG

References (10)

Publisher
Springer Journals
Copyright
Copyright © 2003 by MAIK “Nauka/Interperiodica”
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1023/A:1023638717091
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 4, 2004

There are no references for this article.