@article{ITA_1975__9_3_5_0, author = {Criscuolo, G. and Minicozzi, E. and Trautteur, G.}, title = {Limiting recursion and the arithmetic hierarchy}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {9}, year = {1975}, pages = {5-12}, mrnumber = {396238}, zbl = {0322.02039}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_1975__9_3_5_0} }
Criscuolo, G.; Minicozzi, E.; Trautteur, G. Limiting recursion and the arithmetic hierarchy. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 9 (1975) pp. 5-12. http://gdmltest.u-ga.fr/item/ITA_1975__9_3_5_0/
[1] Limiting Recursion, J. Symb. Logic, 30 (1965), 28-48. | Zbl 0203.01201
,[2] Toward a Mathematical Theory of lnductive Inference, Information and Control, 28 (1975), 125-155. | Zbl 0375.02028
and ,[3] Langage Identification in the Limit., Information and Control, 10 (1967), 447-474. | Zbl 0259.68032
,[4] 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] Some Decidability Results on Grammatical Ingerence and Complexity, Information and Control, 20 (1972), 244-266. | Zbl 0242.68053
,[6] Su certe teorie non enumerabili, Annali di Matematica Pura e Applicata, Bologna, Serie IV, 98 (1974), 110-152. | Zbl 0286.02051
,[7] Iterated Limiting Recursion and the Program Minimization Problem, J. Assoc. Comp. Mach., 21 (1974), pp. 436-445. | Zbl 0352.68060
[8] Trial & Error Predicates etc., J. Symb. Logic, 30 (1965), 49-57. | Zbl 0193.30102
,[9] Degrees of Unsolvability, North-Holland, 1971, pp. 23 et 29. | Zbl 0245.02037
,[10] Computability and Unsolvability, McGraw-Hill, 1958, pp. 58-63. | Zbl 0080.00902
,