A. Asperti, The intensional content of rice's theorem, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.113-119, 2008.

S. Ceitin, Algorithmic operators in constructive metric spaces English translation, Trudy Matematiki Instituta Steklov, pp.295-3611, 1962.

N. Y. Johanna, N. Franklin, F. Greenberg, G. Stephan, and . Wu, Anti-complex sets and reducibilities with tiny use, J. Symb. Log, vol.78, issue.4, pp.1307-1327, 2013.

R. M. Friedberg, Un contre-exemple relatif aux fonctionnelles récursives, Comptes Rendus de l'Académie des Sciences, pp.852-854, 1958.

D. Gajser, Verifying time complexity of Turing machines, Theoretical Computer Science, vol.600, pp.86-97, 2015.
DOI : 10.1016/j.tcs.2015.07.028

M. Hoyrup and C. Rojas, On the Information Carried by Programs About the Objects they Compute, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015 Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, pp.447-459, 2015.
DOI : 10.1007/s00224-016-9726-9
URL : https://hal.archives-ouvertes.fr/hal-01067618

. Kozen, Indexing of subrecursive classes, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.277-301, 1980.
DOI : 10.1145/800133.804358

G. Kreisel, D. Lacombe, and J. R. Schoenfield, Fonctionnelles récursivement définissables et fonctionnelles récursives, Comptes Rendus de l'Académie des Sciences, pp.399-402, 1957.

M. Li and P. M. Vitanyi, An Introduction to Kolmogorov Complexity and Its Applications, 1993.

R. Albert, D. M. Meyer, and . Ritchie, The complexity of loop programs, Proceedings of the 1967 22Nd National Conference, ACM '67, pp.465-469, 1967.

G. Henry and . Rice, Classes of recursively enumerable sets and their decision problems. Transactions of the, pp.358-366, 1953.

N. Shapiro, Degrees of computability. Transactions of the, pp.281-299, 1956.

K. Weihrauch, Computable Analysis, 2000.