C. S. Calude, Information and Randomness. An Algorithmic Perspective. Second Edition, 2002.

G. J. Chaitin, A Theory of Program Size Formally Identical to Information Theory, Journal of the ACM, vol.22, issue.3, pp.329-340, 1975.
DOI : 10.1145/321892.321894

R. Downey and E. Griffiths, Abstract., The Journal of Symbolic Logic, vol.1, issue.02, pp.533-554, 2004.
DOI : 10.1145/321892.321894

P. Gács, Every sequence is reducible to a random one, Information and Control, vol.70, issue.2-3, pp.186-192, 1986.
DOI : 10.1016/S0019-9958(86)80004-3

A. Ku?era, Measure, ?? 1 0 -classes and complete extensions of PA, Recursion Theory Week. LNM, vol.46, pp.245-259, 1985.
DOI : 10.1016/S0049-237X(08)71117-0

S. A. Kurtz, Randomness and genericity in the degrees of unsolvatibility, 1981.

M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 2008.

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

J. S. Miller, Abstract., The Journal of Symbolic Logic, vol.212, issue.03, pp.907-913, 2004.
DOI : 10.1007/BF01694181

J. S. Miller, The K-degrees, low for K degrees and weakly low for K oracles, Notre Dame Journal of Formal Logic

A. Nies, Computability and Randomness, 2009.
DOI : 10.1093/acprof:oso/9780199230761.001.0001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.3982

A. Nies, F. Stephan, and S. A. Terwijn, Abstract, The Journal of Symbolic Logic, vol.54, issue.02, pp.515-535, 2005.
DOI : 10.1007/BF01694181

P. Odifreddi, Classical Recursion Theory I, 1989.

P. Odifreddi, Classical Recursion Theory II, 1999.

D. Osherson and S. Weinstein, RECOGNIZING STRONG RANDOM REALS, The Review of Symbolic Logic, vol.1, issue.01, pp.56-63, 2008.
DOI : 10.1017/S1755020308080076

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

R. I. Soare, Recursively Enumerable Sets and Degrees, 1987.

F. Stephan, Martin-Löf Random and PA-complete Sets, Proceedings of ASL Logic Colloquium, pp.342-348, 2002.
DOI : 10.1017/9781316755723.016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.8683

F. Stephan and G. Wu, Presentations of K-Trivial Reals and Kolmogorov Complexity. New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, pp.461-469, 2005.