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

B. Matthew-de, Quasi-polish spaces, Ann. Pure Appl. Logic, vol.164, issue.3, pp.356-381, 2013.

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

R. Freivalds and R. Wiehagen, Inductive inference with additional information, Journal of Information Processing and Cybernetics, vol.15, pp.179-185, 1979.

A. Grzegorczyk, On the definitions of computable real continuous functions, Fundamenta Mathematicae, vol.44, pp.61-71, 1957.

P. Hertling, Computable real functions: Type 1 computability versus Type 2 computability, CCA, 1996.

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

B. A. Kushner, The Constructive Mathematics of A. A. Markov, The American Mathematical Monthly, vol.113, issue.6, pp.559-566, 2006.
DOI : 10.2307/27641983

D. Lacombe, Extension de la notion de fonction récursive aux fonctions d?une ou plusieurs variables réelles I-III, Comptes Rendus Académie des Sciences Paris, vol.240241, pp.2478-248013, 1955.

]. A. Mar54 and . Markov, On the continuity of constructive functions (rrussian), Uspekhi Mat. Nauk, vol.9, pp.226-230, 1954.

J. Myhill and J. C. Shepherdson, Effective operations on partial recursive functions, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.74, issue.4, pp.310-317, 1955.
DOI : 10.1002/malq.19550010407

B. Marian and . Pour, A comparison of five " computable " operators, Mathematical Logic Quarterly, vol.6, pp.15-22325, 1960.

H. G. Rice, Classes of recursively enumerable sets and their decision problems. Transactions of the, pp.358-366, 1953.
DOI : 10.1090/s0002-9947-1953-0053041-6

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

M. Schröder, Extended admissibility, Theoretical Computer Science, vol.284, issue.2, pp.519-538, 2002.
DOI : 10.1016/S0304-3975(01)00109-8

L. Victor and . Selivanov, Index sets in the hyperarithmetical hierarchy, Siberian Mathematical Journal, vol.25, pp.474-488, 1984.

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

D. Spreen, Representations versus numberings: on the relationship of two computability notions, Theoretical Computer Science, vol.262, issue.1-2, pp.473-499, 2001.
DOI : 10.1016/S0304-3975(00)00319-4

A. Turing, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

K. Weihrauch, Computable Analysis, 2000.