Free Access
| Issue |
R.A.I.R.O. Informatique théorique
Volume 9, Number R3, 1975
|
|
|---|---|---|
| Page(s) | 5 - 12 | |
| DOI | https://doi.org/10.1051/ita/197509R300051 | |
| Published online | 03 February 2017 | |
- M. E. GOLD, Limiting Recursion, J. Symb. Logic, 30 (1965), 28-48. [Zbl: 0203.01201] [Google Scholar]
- M.BLUM and L. BLUM, Toward a Mathematical Theory of lnductive Inference, Information and Control, 28 (1975), 125-155. [Zbl: 0375.02028] [Google Scholar]
- M. E. GOLD, Langage Identification in the Limit., Information and Control, 10 (1967), 447-474. [Zbl: 0259.68032] [Google Scholar]
- 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. [Google Scholar]
- J. FELDMAN, Some Decidability Results on Grammatical Ingerence and Complexity, Information and Control, 20 (1972), 244-266. [Zbl: 0242.68053] [Google Scholar]
- R. MAGARI, Su certe teorie non enumerabili, Annali di Matematica Pura e Applicata, Bologna, Serie IV, 98 (1974), 110-152. [Zbl: 0286.02051] [Google Scholar]
- L. K. SCHUBERT Iterated Limiting Recursion and the Program Minimization Problem, J. Assoc. Comp. Mach., 21 (1974), pp. 436-445. [Zbl: 0352.68060] [Google Scholar]
- H. PUTNAM, Trial & Error Predicates etc., J. Symb. Logic, 30 (1965), 49-57. [Zbl: 0193.30102] [Google Scholar]
- J. R. SCHOENFIELD, Degrees of Unsolvability, North-Holland, 1971, pp. 23 et 29. [Zbl: 0245.02037] [Google Scholar]
- M. DAVIS, Computability and Unsolvability, McGraw-Hill, 1958, pp. 58-63. [Zbl: 0080.00902] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.