Ergodic theorems for individual random sequences

Theoretical Computer Science

Volumn 207, Issue 2, 1998, Pages 343-361

  V'yugin, V V ^a  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Algorithmic information theory; Birkhoff's ergodic theorem; Individual random sequence; Kolmogorov complexity; Shannon McMillan Breiman theorem

Indexed keywords

EID: 0346396019     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00072-3     Document Type: Article

References (23)

1. P. Billingsley, Ergodic theory and information, John Wiley and Sons, New York, 1965.
2. G.D. Birkhoff, Proof of the ergodic theorem, Proc. Nat. Acad. USA 17 (1931) 656-660.
3. E. Bishop, Foundations of constructive analysis, McGraw-Hill, New York, 1967.
4. A.A. Brudno, Entropy and the complexity of the trajectories of a dynamical system, Trans. Mosc. Math. Soc. 44 (1983) 127-151.
5. P. Gacs, Exact expressions for some randomness tests, Zetsch. für Math. Logik und Grundl. Math. 26 (1980) 385-394.
6. A.N. Kolmogorov, Three approaches to the quantitative definition of information, Problems Inform. Transmission 1 (1) (1965) 4-7.
7. A.N. Kolmogorov, The logical basis for information theory and probability theory, IEEE Trans. Inform. Theory IT-14 (1968) 662-664.
8. A.N. Kolmogorov, Combinatorial basis of information theory and probability theory, Russ. Math. Surveys 38 (1983) 29-40.
9. A.N. Kolmogorov, V.A. Uspensky, Algorithms and randomness, Theory Probab. Appl. 32 (1987) 389-412.
10. U. Krengel, Ergodic Theorems, Walter de Cruyter, Berlin, 1985.
11. M. Lambalgen, Random Sequences, Academish Proefshri't, Amsterdam, 1987.
12. L.A. Levin, On the concept of random sequence, Sov. Math. Dokl. 14 (1973) 1413-1416.
13. M. Li, P. Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, Springer, New York, 1993.
14. P. Martin-Löf, The definition of random sequences, Inform. and Control 9 (6) (1966) 602-619.
15. D. Ornstein, B. Weiss, The Shannon-McMillan-Breiman theorem for a class of amenable groups, Israel J. Math. 44 (1) (1983) 53-60.
16. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
17. C.P. Schnorr, Process complexity and effective random tests, J. Comput. System Sci. 7 (1973) 376-378.
18. C.P. Schnorr, A survey of the theory of random sequences, in: Basic Problems in Methodology and Linguistics, Dordrecht, 1978, pp. 193-211.
19. A.N. Shiryaev, Probability, Springer, Berlin, 1984.
20. V.A. Uspensky, A.L. Semenov, A. Kh. Shen, Can an individual sequence of zeros and ones be random?, Russian Math. Surveys 45 (1) (1990) 121-189.
21. V.G. Vovk, The law of the iterated logarithm for random Kolmogorov, or chaotic sequences, SIAM Theory Probab. Appl. 32 (3) (1987) 413-425.
22. V.G. Vovk, V.V. V'yugin, On the empirical validity of the Bayesian method, J. Royal Statist. Soc. B 55 (1) (1993) 253-266.
23. A.K. Zvonkin, L.A. Levin, The complexity of finite objects and the algorithmic concepts of information and randomness, Russ. Math. Surv. 25 (1970) 83-124.