{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:28:08Z","timestamp":1761974888647},"reference-count":27,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":9970,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/s0019-9958(86)80042-0","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"12-40","source":"Crossref","is-referenced-by-count":58,"title":["On the complexity of inductive inference"],"prefix":"10.1016","volume":"69","author":[{"given":"Robert P.","family":"Daley","sequence":"first","affiliation":[]},{"given":"Carl H.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(86)80042-0_bib1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80042-0_bib2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"A survey of inductive inference: theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0019-9958(86)80042-0_bib3","series-title":"Theory of Algorithms and Programs I","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","author":"Barzdin","year":"1974"},{"key":"10.1016\/S0019-9958(86)80042-0_bib4","first-page":"1224","article-title":"On the prediction of general recursive functions","volume":"13","author":"Barzdin","year":"1972","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0019-9958(86)80042-0_bib5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80042-0_bib6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(86)80042-0_bib7","article-title":"Refinements of inductive inference by Popperian machines","author":"Case","year":"1979"},{"key":"10.1016\/S0019-9958(86)80042-0_bib8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80042-0_bib9","series-title":"Theory of Algorithms and Programs, II","first-page":"155","article-title":"On the complexity and optimality of computation in the limit","author":"Freivalds","year":"1975"},{"key":"10.1016\/S0019-9958(86)80042-0_bib10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80042-0_bib11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(86)80042-0_bib12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","article-title":"Limiting Recursion","volume":"30","author":"Gold","year":"1965","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0019-9958(86)80042-0_bib13","series-title":"Aspects of Scientific Explanation","author":"Hempel","year":"1965"},{"key":"10.1016\/S0019-9958(86)80042-0_bib14","article-title":"On the complexity of computation on Turing machines with oracles","author":"Khodzhayev","year":"1970"},{"key":"10.1016\/S0019-9958(86)80042-0_bib15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","article-title":"Research in the theory of inductive inference by GDR mathematicians\u2014a survey","volume":"22","author":"Klette","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/S0019-9958(86)80042-0_bib16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0002-9947-1976-0403933-6","article-title":"Relativization of the theory of computational complexity","volume":"220","author":"Lynch","year":"1976","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0019-9958(86)80042-0_bib17","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/S0019-9958(86)80042-0_bib18","first-page":"358","article-title":"Polynomially complete problems in the logic of automated discovery","volume":"Vol. 32","author":"Pudlak","year":"1975"},{"key":"10.1016\/S0019-9958(86)80042-0_bib19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(79)90045-8","article-title":"Complexity in mechanized hypothesis formation","volume":"8","author":"Pudlak","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(86)80042-0_bib20","series-title":"Mathematics, Matter, and Method","article-title":"Probability and confirmation","author":"Putman","year":"1975"},{"key":"10.1016\/S0019-9958(86)80042-0_bib21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0019-9958(86)80042-0_bib22","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0019-9958(86)80042-0_bib23","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0207035","article-title":"Polynomial time enumeration reducibility","volume":"7","author":"Selman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(86)80042-0_bib24","series-title":"\u00dcber Eingabeabh\u00e4ngigkeit und Komplexit\u00e4t von Inferenzstrategien","author":"Sh\u00e4fer-Richter","year":"1984"},{"key":"10.1016\/S0019-9958(86)80042-0_bib25","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"},{"key":"10.1016\/S0019-9958(86)80042-0_bib26","article-title":"The extension of machien-independent computational complexity theory to oracle machine computation and to the computation of finite functions","author":"Symes","year":"1971"},{"key":"10.1016\/S0019-9958(86)80042-0_bib27","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01702871","article-title":"Speed-ups by changing the order in which sets are enumerated","volume":"5","author":"Young","year":"1971","journal-title":"Math. Systems Theory"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:31Z","timestamp":1548525271000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995886800420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["S0019995886800420"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80042-0","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}