Limiting recursion and the arithmetic hierarchy

G. Criscuolo; E. Minicozzi; G. Trautteur

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1975)

  • Volume: 9, Issue: R3, page 5-12
  • ISSN: 0988-3754

How to cite

top

Criscuolo, G., Minicozzi, E., and Trautteur, G.. "Limiting recursion and the arithmetic hierarchy." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 9.R3 (1975): 5-12. <http://eudml.org/doc/92025>.

@article{Criscuolo1975,
author = {Criscuolo, G., Minicozzi, E., Trautteur, G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {eng},
number = {R3},
pages = {5-12},
publisher = {EDP-Sciences},
title = {Limiting recursion and the arithmetic hierarchy},
url = {http://eudml.org/doc/92025},
volume = {9},
year = {1975},
}

TY - JOUR
AU - Criscuolo, G.
AU - Minicozzi, E.
AU - Trautteur, G.
TI - Limiting recursion and the arithmetic hierarchy
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1975
PB - EDP-Sciences
VL - 9
IS - R3
SP - 5
EP - 12
LA - eng
UR - http://eudml.org/doc/92025
ER -

References

top
  1. [1] M. E. GOLD, Limiting Recursion, J. Symb. Logic, 30 (1965), 28-48. Zbl0203.01201
  2. [2] M. and L. BLUM, Toward a Mathematical Theory of lnductive Inference, Information and Control, 28 (1975), 125-155. Zbl0375.02028
  3. [3] M. E. GOLD, Langage Identification in the Limit., Information and Control, 10 (1967), 447-474. Zbl0259.68032
  4. [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. [5] J. FELDMAN, Some Decidability Results on Grammatical Ingerence and Complexity, Information and Control, 20 (1972), 244-266. Zbl0242.68053
  6. [6] R. MAGARI, Su certe teorie non enumerabili, Annali di Matematica Pura e Applicata, Bologna, Serie IV, 98 (1974), 110-152. Zbl0286.02051
  7. [7] L. K. SCHUBERTIterated Limiting Recursion and the Program Minimization Problem, J. Assoc. Comp. Mach., 21 (1974), pp. 436-445. Zbl0352.68060
  8. [8] H. PUTNAM, Trial & Error Predicates etc., J. Symb. Logic, 30 (1965), 49-57. Zbl0193.30102
  9. [9] J. R. SCHOENFIELD, Degrees of Unsolvability, North-Holland, 1971, pp. 23 et 29. Zbl0245.02037
  10. [10] M. DAVIS, Computability and Unsolvability, McGraw-Hill, 1958, pp. 58-63. Zbl0080.00902

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.