no. R3
Limiting recursion and the arithmetic hierarchy
Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 9 (1975) no. R3, pp. 5-12. 
@article{ITA_1975__9_3_5_0,
     author = {Criscuolo, G. and Minicozzi, E. and Trautteur, G.},
     title = {Limiting recursion and the arithmetic hierarchy},
     journal = {Revue fran\c{c}aise d'automatique informatique recherche op\'erationnelle. Informatique th\'eorique},
     pages = {5--12},
     publisher = {Dunod-Gauthier-Villars},
     address = {Paris},
     volume = {9},
     number = {R3},
     year = {1975},
     mrnumber = {396238},
     zbl = {0322.02039},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1975__9_3_5_0/}
}
TY  - JOUR
AU  - Criscuolo, G.
AU  - Minicozzi, E.
AU  - Trautteur, G.
TI  - Limiting recursion and the arithmetic hierarchy
JO  - Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
PY  - 1975
SP  - 5
EP  - 12
VL  - 9
IS  - R3
PB  - Dunod-Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1975__9_3_5_0/
LA  - en
ID  - ITA_1975__9_3_5_0
ER  - 
%0 Journal Article
%A Criscuolo, G.
%A Minicozzi, E.
%A Trautteur, G.
%T Limiting recursion and the arithmetic hierarchy
%J Revue française d'automatique informatique recherche opérationnelle. Informatique théorique
%D 1975
%P 5-12
%V 9
%N R3
%I Dunod-Gauthier-Villars
%C Paris
%U http://www.numdam.org/item/ITA_1975__9_3_5_0/
%G en
%F ITA_1975__9_3_5_0
Criscuolo, G.; Minicozzi, E.; Trautteur, G. Limiting recursion and the arithmetic hierarchy. Revue française d'automatique informatique recherche opérationnelle. Informatique théorique, Tome 9 (1975) no. R3, pp. 5-12. http://www.numdam.org/item/ITA_1975__9_3_5_0/

[1] M. E. Gold, Limiting Recursion, J. Symb. Logic, 30 (1965), 28-48. | Zbl

[2] M. and L. Blum, Toward a Mathematical Theory of lnductive Inference, Information and Control, 28 (1975), 125-155. | Zbl

[3] M. E. Gold, Langage Identification in the Limit., Information and Control, 10 (1967), 447-474. | Zbl

[4] R. P. Daley, On the Definition of Learning for non Recursive Sequences, Quarterly Report n. 36. Institute for Computer Research, The University of Chicago, Feb. 1, 1973.

[5] J. Feldman, Some Decidability Results on Grammatical Ingerence and Complexity, Information and Control, 20 (1972), 244-266. | Zbl

[6] R. Magari, Su certe teorie non enumerabili, Annali di Matematica Pura e Applicata, Bologna, Serie IV, 98 (1974), 110-152. | Zbl

[7] L. K. Schubert Iterated Limiting Recursion and the Program Minimization Problem, J. Assoc. Comp. Mach., 21 (1974), pp. 436-445. | Zbl

[8] H. Putnam, Trial & Error Predicates etc., J. Symb. Logic, 30 (1965), 49-57. | Zbl

[9] J. R. Schoenfield, Degrees of Unsolvability, North-Holland, 1971, pp. 23 et 29. | Zbl

[10] M. Davis, Computability and Unsolvability, McGraw-Hill, 1958, pp. 58-63. | Zbl