V. Benci, C. Bonanno, S. Galatolo, G. Menconi, and M. Virgilio, Dynamical systems and computable information, Disc. Cont. Dyn. Syst.-B, vol.4, pp.935-960, 2004.

V. Brattka, P. Hertling, and K. Weihrauch, A Tutorial on Computable Analysis, Changing Conceptions of What is Computable, pp.425-492, 2008.
DOI : 10.1007/978-0-387-68546-5_18

P. Billingsley, Ergodic Theory and Information, 1965.

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

V. Bosserhoff, Notions of Probabilistic Computability on Represented Spaces, CCA 2007, pp.45-78, 2008.
DOI : 10.1016/j.entcs.2008.03.013

V. Bosserhoff, Notions of Probabilistic Computability on Represented Spaces, Electronic Notes in Theoretical Computer Science, vol.202, issue.6, pp.965-995, 2008.
DOI : 10.1016/j.entcs.2008.03.013

]. A. Bru83 and . Brudno, Entropy and the complexity of the trajectories of a dynamical system, Transactions of the Moscow Mathematical Society, vol.2, pp.127-151, 1983.

J. Cai and J. Hartmanis, On hausdorff and topological dimensions of the kolmogorov complexity of the real line, Proceedings of the 30th IEEE symposium on Foundations of computer science, pp.605-619, 1994.
DOI : 10.1016/S0022-0000(05)80073-X

[. Gács, Lecture notes on descriptional complexity and randomness

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, Orbit complexity by computable structures, Nonlinearity, vol.13, issue.5, pp.1531-1546, 2000.
DOI : 10.1088/0951-7715/13/5/307

S. Galatolo, M. Hoyrup, and C. Rojas, Dynamics and abstract computability: computing invariant measures, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00517367

[. Galatolo, M. Hoyrup, and C. Rojas, An effective Borel- Cantelli lemma. Constructing orbits with required statistical properties, Theoretical Computer Science, 2009.

B. Hasselblatt and A. Katok, Introduction to the Modern Theory of Dynamical Systems, volume 54 of Encyclopedia of Mathematics and Its Applications, 1995.

B. Hasselblatt and A. Katok, Handbook of Dynamical Systems, 2002.

M. Hoyrup and C. Rojas, Applications of effective probability theory to martin-löf randomness, Proceedings of ICALP, 2009.

M. Hoyrup and C. Rojas, Computability of probability measures and Martin-Löf randomness over metric spaces. Information and Computation, 2009.

P. Hertling and K. Weihrauch, Random elements in effective topological spaces with measure, Information and Computation, vol.181, issue.1, pp.32-56, 2003.
DOI : 10.1016/S0890-5401(02)00034-2

R. Kenny, Orbit complexity and computable Markov partitions, 2008.

H. Jack and . Lutz, The dimensions of individual strings and sequences. Information and Computation, pp.49-79, 2003.

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

E. Mayordomo, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Information Processing Letters, vol.84, issue.1, 2001.
DOI : 10.1016/S0020-0190(02)00343-5

M. Nakamura, Ergodic theorems for algorithmically random sequences, IEEE Information Theory Workshop, 2005., 2005.
DOI : 10.1109/ITW.2005.1531876

S. Nandakumar, An effective ergodic theorem and some applications, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.39-44, 2008.
DOI : 10.1145/1374376.1374383

B. Yakov and . Pesin, Dimension Theory in Dynamical Systems: Contemporary Views and Applications, Chicago Lectures in Mathematics, 1998.

K. Petersen, Ergodic Theory, 1983.
DOI : 10.1017/CBO9780511608728

J. Reimann, Computability and fractal dimension, 2004.

H. Jr and . Rogers, Theory of Recursive Functions and Effective Computability, 1987.

L. Staiger, Constructive dimension equals Kolmogorov complexity, Information Processing Letters, vol.93, issue.3, pp.149-153, 2005.
DOI : 10.1016/j.ipl.2004.09.023

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

V. Vladimir and . V-'yugin, Ergodic theorems for individual random sequences, Theoretical Computer Science, vol.207, issue.4, pp.343-361, 1998.

P. Walters, An Introduction to Ergodic Theory, Graduate Texts in Mathematics, vol.79, 1982.
DOI : 10.1007/978-1-4612-5775-2

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

K. Weihrauch, Computable Analysis, 2000.

S. Homer and . White, Algorithmic complexity of points in dynamical systems, Ergodic Theory and Dynamical Systems, vol.13, pp.807-830, 1993.

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