Randomness on computable probability spaces - A dynamical point of view

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 469-480

  Gacs, Peter ^a   Hoyrup, Mathieu ^b   Rojas, Cristobal ^c  

^a BOSTON UNIVERSITY   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c Centre de Recherche en Epistemologie Appliquee Ecole Polytechnique   (France)

Author keywords

Birkhoff's ergodic theorem; Computable measures; Schnorr randomness

Indexed keywords

BIRKHOFF'S ERGODIC THEOREMS; COMPUTABLE MEASURES; ERGODIC THEOREM; POINT OF VIEWS; POINT WISE; PROBABILITY SPACES; SCHNORR RANDOMNESS; STATISTICAL BEHAVIOR;

COMPUTER SCIENCE;

RANDOM PROCESSES;

EID: 84880198126     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Patrick Billingsley. Convergence of Probability Measures. John Wiley, New York, 1968.
2. Rodney G. Downey and Evan J. Griffiths. Schnorr randomness. Electr. Notes Theor. Comput. Sci., 66(1), 2002.
3. Peter Gács. Uniform test of algorithmic randomness over a general space. Theoretical Computer Science, 341:91-137, 2005.
4. Stefano Galatolo, Mathieu Hoyrup, and Cristóbal Rojas. Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Submitted, 2007.
5. Mathieu Hoyrup and Cristóbal Rojas. Computability of probability measures and Martin-Löf randomness over metric spaces. Information and Computation, 2009. To appear.
6. Stefano Isola. On systems with finite ergodic degree. Far east journal of dynamical systems, 5:1, 2003.
7. Andrey N. Kolmogorov. Three approaches to the quantitative definition of information. Problems in Information Transmission, 1:1-7, 1965.
8. Per Martin-Löf. The definition of random sequences. Information and Control, 9(6):602-619, 1966.
9. Claus-Peter Schnorr. Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, volume 218 of Lecture Notes in Mathematics. Springer-Verlag, Berlin-New York, 1971.
10. Claus-Peter Schnorr. The process complexity and effective random tests. In STOC, pages 168-176, 1972.
11. Alan Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2, 42:230-265, 1936.
12. Marcelo Viana. Stochastic dynamics of deterministic systems. Lecture Notes XXI Braz. Math. Colloq. IMPA Rio de Janeiro, 1997.
13. J. Ville. Etude Critique de la Notion de Collectif. Gauthier-Villars, Paris, 1939.
14. V'yugin V.V. Effective convergence in probability and an ergodic theorem for individual random sequences. SIAM Theory of Probability and Its Applications, 42(1):39-50, 1997.
15. Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191-210, 1993. Fundamental Study.
16. Lai-Sang Young. What are SRB measures, and which dynamical systems have them? J. Stat. Phys., 108:733-754, 2002.
17. A.K. Zvonkin and L.A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematics Surveys, 256:83-124, 1970.