. B. Krishna, J. M. Athreya, J. H. Hitchcock, E. Lutz, and . Mayordomo, Effective strong dimension in algorithmic information and computational complexity, SIAM J. Comput, vol.37, issue.3 1, pp.671-705, 2007.

L. Bienvenu, A. R. Day, M. Hoyrup, I. Mezhirov, and A. Shen, A constructive version of Birkhoff's ergodic theorem for Martin-L ¨ of random points, 2010.

L. Bienvenu, A. Day, I. Mezhirov, and A. Shen, Ergodic-Type Characterizations of Algorithmic Randomness, In Computability in Europe Lecture Notes in Computer Science, vol.6158, issue.4, pp.49-58, 2010.
DOI : 10.1007/978-3-642-13962-8_6

J. Gregory and . Chaitin, A theory of program size formally identical to information theory, J. ACM, vol.22, issue.3 4, pp.329-340, 1975.

R. Downey and D. Hirschfeldt, Algorithmic Randomness and Complexity, 2010.
DOI : 10.1007/978-0-387-68441-3

N. Y. Johanna, N. Franklin, J. S. Greenberg, K. Miller, and . Ng, Martin-L ¨ of random points satisfy Birkhoff's ergodic theorem for effectively closed sets, 2010.

P. Gács, Exact Expressions for Some Randomness Tests, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.15, issue.25-27, pp.385-394, 1980.
DOI : 10.1002/malq.19800262502

L. A. Levin, On the notion of a random sequence, Soviet Mathematics Doklady, vol.14, issue.4, pp.1413-1416, 1973.

H. Jack and . Lutz, Dimension in complexity classes, IEEE Conference on Computational Complexity, pp.158-169, 2000.

H. Jack and . Lutz, Effective fractal dimensions, Mathematical Logic Quarterly, vol.51, issue.1 1, pp.62-72, 2005.

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

[. Of, The definition of random sequences, Information and Control, vol.9, issue.6 4, pp.602-619, 1966.

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

]. A. Nie09 and . Nies, Computability and randomness. Oxford logic guides, 2009.

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

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

M. Smorodinsky, Ergodic Theory, Entropy, Lecture Notes in Mathematics, vol.214, issue.4 6, 1971.
DOI : 10.1007/BFb0066086

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