Abstract
We extend the notion of randomness (in the version introduced by Schnorr) to computable probability spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the statistical behavior of the system (Birkhoff’s pointwise ergodic theorem). We prove that a point is Schnorr random if and only if it is typical for every mixing computable dynamics. To prove the result we develop some tools for the theory of computable probability spaces (for example, morphisms) that are expected to have other applications.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Billingsley, P.: Convergence of Probability Measures. Wiley, New York (1968)
Downey, R.G., Griffiths, E.J.: Schnorr randomness. Electr. Notes Theor. Comput. Sci. 66(1), 1199–1205 (2002)
Gács, P.: Uniform test of algorithmic randomness over a general space. Theor. Comput. Sci. 341, 91–137 (2005)
Galatolo, S., Hoyrup, M., Rojas, C.: Effective symbolic dynamics, random points, statistical behavior, complexity and entropy. Inf. Comput. (to appear)
Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-Löf randomness over metric spaces. Inf. Comput. 207(7), 830–847 (2009)
Isola, S.: On systems with finite ergodic degree. Far East J. Dyn. Syst. 5, 1–62 (2003)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inf. Transm. 1, 1–7 (1965)
Li, M., Vitanyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin (1993)
Martin-Löf, P.: The definition of random sequences. Inf. Control 9(6), 602–619 (1966)
Schnorr, C.-P.: Zufälligkeit und Wahrscheinlichkeit: Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. Lecture Notes in Mathematics, vol. 218. Springer, Berlin/New York (1971)
Schnorr, C.-P.: The process complexity and effective random tests. In: STOC, pp. 168–176 (1972)
Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 2(42), 230–265 (1936)
Viana, M.: Stochastic dynamics of deterministic systems. In: Lecture Notes XXI Braz. Math. Colloq. IMPA, Rio de Janeiro (1997)
Ville, J.: Etude Critique de la Notion de Collectif. Gauthier-Villars, Paris (1939)
V’yugin, V.V.: Effective convergence in probability and an ergodic theorem for individual random sequences. SIAM Theory Probab. Appl. 42(1), 39–50 (1997)
Weihrauch, K.: Computability on computable metric spaces. Theor. Comput. Sci. 113, 191–210 (1993). Fundamental study
Young, L.-S.: What are SRB measures, and which dynamical systems have them? J. Stat. Phys. 108, 733–754 (2002)
Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 256, 83–124 (1970)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partly supported by ANR Grant 05 2452 260 ox.
Rights and permissions
About this article
Cite this article
Gács, P., Hoyrup, M. & Rojas, C. Randomness on Computable Probability Spaces—A Dynamical Point of View. Theory Comput Syst 48, 465–485 (2011). https://doi.org/10.1007/s00224-010-9263-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-010-9263-x