{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T07:40:45Z","timestamp":1693467645015},"reference-count":10,"publisher":"EDP Sciences","issue":"R3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["R.A.I.R.O. Informatique th\u00e9orique"],"published-print":{"date-parts":[[1975]]},"DOI":"10.1051\/ita\/197509r300051","type":"journal-article","created":{"date-parts":[[2017,2,9]],"date-time":"2017-02-09T09:12:19Z","timestamp":1486631539000},"page":"5-12","source":"Crossref","is-referenced-by-count":5,"title":["Limiting recursion and the arithmetic hierarchy"],"prefix":"10.1051","volume":"9","author":[{"given":"G.","family":"Criscuolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Minicozzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Trautteur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"GOLD M. E., Limiting Recursion, J. Symb. Logic, 30 (1965), 28-48.0203.01201","DOI":"10.2307\/2270580"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"BLUM M. and BLUM L., Toward a Mathematical Theory of lnductive Inference, Information and Control, 28 (1975), 125-155.0375.02028","DOI":"10.1016\/S0019-9958(75)90261-2"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"GOLD M. E., Langage Identification in the Limit., Information and Control, 10 (1967), 447-474.0259.68032","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"R4","unstructured":"DALEY R. P., On the Definition of Learning for non Recursive Sequences, Quarterly Report n. 36. Institute for Computer Research, The University of Chicago, Feb. 1, 1973."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"FELDMAN J., Some Decidability Results on Grammatical Ingerence and Complexity, Information and Control, 20 (1972), 244-266.0242.68053","DOI":"10.1016\/S0019-9958(72)90424-X"},{"key":"R6","unstructured":"MAGARI R., Su certe teorie non enumerabili, Annali di Matematica Pura e Applicata, Bologna, Serie IV, 98 (1974), 110-152.0286.02051"},{"key":"R7","unstructured":"SCHUBERT L. K. Iterated Limiting Recursion and the Program Minimization Problem, J. Assoc. Comp. Mach., 21 (1974), pp. 436-445.0352.68060"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"PUTNAM H., Trial & Error Predicates etc., J. Symb. Logic, 30 (1965), 49-57.0193.30102","DOI":"10.2307\/2270581"},{"key":"R9","unstructured":"SCHOENFIELD J. R., Degrees of Unsolvability, North-Holland, 1971, pp. 23 et 29.0245.02037"},{"key":"R10","unstructured":"DAVIS M., Computability and Unsolvability, McGraw-Hill, 1958, pp. 58-63.0080.00902"}],"container-title":["Revue fran\u00e7aise d'automatique informatique recherche op\u00e9rationnelle. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197509R300051\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:11:22Z","timestamp":1498371082000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/197509R300051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"references-count":10,"journal-issue":{"issue":"R3"},"alternative-id":["ita197509R300051"],"URL":"https:\/\/doi.org\/10.1051\/ita\/197509r300051","relation":{},"ISSN":["0397-9326"],"issn-type":[{"value":"0397-9326","type":"print"}],"subject":[],"published":{"date-parts":[[1975]]}}}