P. Billingsley, Convergence of Probability Measures, 1968.
DOI : 10.1002/9780470316962

G. Rodney, E. J. Downey, and . Griffiths, Schnorr randomness, Electr. Notes Theor. Comput. Sci, vol.66, issue.1 2, 2002.

P. Gács, Uniform test of algorithmic randomness over a general space, Theoretical Computer Science, vol.341, issue.1-3, pp.91-137, 2005.
DOI : 10.1016/j.tcs.2005.03.054

S. Galatolo, M. Hoyrup, and C. Rojas, Effective symbolic dynamics, random points, statistical behavior, complexity and entropy, Information and Computation, vol.208, issue.1
DOI : 10.1016/j.ic.2009.05.001
URL : https://hal.archives-ouvertes.fr/inria-00517382

M. Hoyrup and C. Rojas, Computability of probability measures and Martin-L??f randomness over metric spaces, Information and Computation, vol.207, issue.7, pp.830-847, 2009.
DOI : 10.1016/j.ic.2008.12.009

S. Isola, On systems with finite ergodic degree. Far east journal of dynamical systems, 2003.

M. Li and P. M. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 1993.

P. Martin-löf, The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966.
DOI : 10.1016/S0019-9958(66)80018-9

C. Schnorr, Zufälligkeit und Wahrscheinlichkeit Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, Lecture Notes in Mathematics, vol.218, issue.12, p.14, 1971.

C. Schnorr, The process complexity and effective random tests., Proceedings of the fourth annual ACM symposium on Theory of computing , STOC '72, pp.168-176, 1972.
DOI : 10.1145/800152.804910

A. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

M. Viana, Stochastic dynamics of deterministic systems, Lecture Notes XXI Braz. Math. Colloq. IMPA Rio de Janeiro, issue.10, 1997.

J. Ville, Etude Critique de la Notion de Collectif, 1939.

V. 'yugin and V. V. , Effective convergence in probability and an ergodic theorem for individual random sequences. SIAM Theory of Probability and Its Applications, pp.39-50, 1997.

K. Weihrauch, Computability on computable metric spaces, Theoretical Computer Science, vol.113, issue.2, pp.191-210, 1993.
DOI : 10.1016/0304-3975(93)90001-A

L. Young, What are SRB measures, and which dynamical systems have them?, Journal of Statistical Physics, vol.108, issue.5/6, pp.733-754, 2002.
DOI : 10.1023/A:1019762724717

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 Mathematical Surveys, vol.25, issue.6, pp.83-124, 1970.
DOI : 10.1070/RM1970v025n06ABEH001269