K. Weihrauch, Computable Analysis: An Introduction, 2000.

M. Hoyrup, Irreversible Computable Functions, STACS, ser. LIPIcs Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.362-373, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00915952

R. G. Downey and G. Laforte, Presentations of computably enumerable reals, Theoretical Computer Science, vol.284, issue.2, pp.539-555, 2002.
DOI : 10.1016/S0304-3975(01)00110-4
URL : http://doi.org/10.1016/s0304-3975(01)00110-4

V. Brattka and G. Presser, Computability on subsets of metric spaces, Theoretical Computer Science, vol.305, issue.1-3, pp.43-76, 2003.
DOI : 10.1016/S0304-3975(02)00693-X

M. Hoyrup, Computability of the ergodic decomposition, Annals of Pure and Applied Logic, vol.164, issue.5, pp.542-549, 2013.
DOI : 10.1016/j.apal.2012.11.005
URL : https://hal.archives-ouvertes.fr/hal-00746473

C. G. Jockusch, Simple proofs of some theorems on high degrees of unsolvability, Journal canadien de math??matiques, vol.29, issue.5, pp.1072-1080, 1977.
DOI : 10.4153/CJM-1977-105-5

M. Li and P. M. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 1993.
DOI : 10.1007/978-1-4757-2606-0

R. L. Graham, th powers, Pacific Journal of Mathematics, vol.14, issue.1, pp.85-92, 1964.
DOI : 10.2140/pjm.1964.14.85

M. Hoyrup, Genericity of Weakly Computable Objects, Theory of Computing Systems, pp.1-25, 2016.
DOI : 10.1007/s00224-016-9737-6
URL : https://hal.archives-ouvertes.fr/hal-01095864

A. Hemmerling, Effective metric spaces and representations of the reals, Theoretical Computer Science, vol.284, issue.2, pp.347-372, 2002.
DOI : 10.1016/S0304-3975(01)00093-7

K. Weihrauch, On computable metric spaces Tietze-Urysohn extension is computable, " in Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis, ser. CCA '00, pp.357-368, 2001.