V. Brattka, Computable invariance, Theoretical Computer Science, vol.210, issue.1, pp.3-20, 1999.
DOI : 10.1016/S0304-3975(98)00095-4
URL : http://doi.org/10.1016/s0304-3975(98)00095-4

V. Brattka, Computable Versions of Baire???s Category Theorem, MFCS, pp.224-235, 2001.
DOI : 10.1007/3-540-44683-4_20

M. Braverman and M. Yampolsky, Non-computable Julia sets, Journal of the American Mathematical Society, vol.19, issue.03, pp.551-578, 2006.
DOI : 10.1090/S0894-0347-05-00516-3
URL : http://arxiv.org/abs/math/0604371

M. Braverman and M. Yampolsky, Constructing non-computable Julia sets, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.709-716, 2007.
DOI : 10.1145/1250790.1250893

M. Braverman and M. Yampolsky, Computability of Julia Sets, 2008.

G. Rodney, G. Downey, and . Laforte, Presentations of computably enumerable reals, Theor. Comput. Sci, vol.284, issue.2, pp.539-555, 2002.

M. Hoyrup, Randomness and the Ergodic Decomposition, CiE, pp.122-131, 2011.
DOI : 10.1007/978-3-642-56999-9
URL : https://hal.archives-ouvertes.fr/inria-00586736

M. A. Ingrassia, P-genericity for Recursively Enumerable Sets, 1981.

G. Carl and . Jockush, Degrees of generic sets, Recursion Theory: its Generalisations and Applications, pp.110-139, 1980.

. Jr, C. G. Jockusch, and D. B. Posner, Double jumps of minimal degrees, The Journal of Symbolic Logic, vol.43, issue.4 8, pp.715-724, 1978.

J. S. Miller, Abstract., The Journal of Symbolic Logic, vol.44, issue.02, pp.555-584, 2004.
DOI : 10.1215/S0012-7094-41-00838-4

J. Myhill, Category methods in recursion theory, Pacific Journal of Mathematics, vol.11, issue.4, pp.1479-1486, 1961.
DOI : 10.2140/pjm.1961.11.1479

J. Myhill, A recursive function, defined on a compact interval and having a continuous derivative that is not recursive. Michigan Math, J, vol.18, issue.2 2, pp.97-98, 1971.

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

B. Marian, J. I. Pour-el, and . Richards, Computability in Analysis and Physics. Perspectives in Mathematical Logic, 1989.

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

A. L. Selman, Arithmetical Reducibilities I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.64, issue.1, pp.335-350, 1971.
DOI : 10.1002/malq.19710170139

F. Stephan and G. Wu, Presentations of K-trivial reals and Ksolmogorov complexity, CiE, pp.461-469, 2005.

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.

K. Weihrauch, Computable Analysis, 2000.
DOI : 10.1007/978-3-642-56999-9

M. Yasugi, T. Mori, and Y. Tsujii, Effective properties of sets and functions in metric spaces with computability structure, Theoretical Computer Science, vol.219, issue.1-2, pp.467-486, 1999.
DOI : 10.1016/S0304-3975(98)00301-6