V. Brattka, M. Hendtlass, and A. P. Kreuzer, On the uniform computational content of the Baire category theorem. CoRR, abs, 1510.

D. Bridges, H. Ishihara, and L. V??t¸?v??tv??t¸?, A new constructive version of Baire's theorem. Hokkaido Math, J, vol.35, issue.1, pp.107-118, 2006.

K. Douglas, S. G. Brown, and . Simpson, The Baire category theorem in weak subsystems of second-order arithmetic, J. Symbolic Logic, vol.58, issue.2, pp.557-578, 1993.

R. M. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, Proceedings of the National Academy of Sciences of the United States of America, pp.236-238, 1944.

M. Hoyrup, Irreversible computable functions, 31st International Symposium on Theoretical Aspects of Computer Science STACS 2014 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.362-373, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00915952

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

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

G. Carl and . Jockush, Simple proofs of some theorems on high degrees. Canad, J. Math, vol.29, pp.1072-1080, 1977.

S. Hawtrey and J. , Applications of the Baire category theorem. Real Anal, Exchange, vol.23, issue.2, pp.363-394, 1999.

S. C. Kleene and E. L. Post, The Upper Semi-Lattice of Degrees of Recursive Unsolvability, The Annals of Mathematics, vol.59, issue.3, pp.379-407, 1954.
DOI : 10.2307/1969708

H. Jack and . Lutz, Category and measure in complexity classes, SIAM J. Comput, vol.19, issue.6, pp.1100-1131, 1990.

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

A. A. Muchnik, On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. Akad. Nauk SSSR, vol.108, pp.194-197, 1956.

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