{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:33Z","timestamp":1760202513106},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80072-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"589-604","source":"Crossref","is-referenced-by-count":37,"title":["Open problems in \u201csystems that learn\u201d"],"prefix":"10.1016","volume":"49","author":[{"given":"Mark","family":"Fulk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel N.","family":"Osherson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80072-8_bib1","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\/S0022-0000(05)80072-8_bib2","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","volume":"Vol. 210","author":"Barzdin","year":"1974"},{"key":"10.1016\/S0022-0000(05)80072-8_bib3","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\/S0022-0000(05)80072-8_bib4","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\/S0022-0000(05)80072-8_bib5","series-title":"Proceedings, Workshop on Computational Learning Theory","first-page":"133","article-title":"The power of vacillation","author":"Case","year":"1988"},{"key":"10.1016\/S0022-0000(05)80072-8_bib6","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"Vol. 140","author":"Case","year":"1982"},{"key":"10.1016\/S0022-0000(05)80072-8_bib7","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\/S0022-0000(05)80072-8_bib8","article-title":"A Study of Inductive Inference Machines","author":"Fulk","year":"1985"},{"key":"10.1016\/S0022-0000(05)80072-8_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","article-title":"Prudence and other conditions on formal language learning","volume":"85","author":"Fulk","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80072-8_bib10","series-title":"Proceedings, Second Annual Workshop on Computational Learning Theory, Santa Cruz, CA","first-page":"175","article-title":"Learning in the presence of inaccurate information","author":"Fulk","year":"1989"},{"key":"10.1016\/S0022-0000(05)80072-8_bib11","article-title":"Open Problems in Systems That Learn","author":"Fulk","year":"1989"},{"key":"10.1016\/S0022-0000(05)80072-8_bib12","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\/S0022-0000(05)80072-8_bib13","series-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0022-0000(05)80072-8_bib14","article-title":"Learning in the Presence of Additional Information and Inaccurate Information","author":"Jain","year":"1990"},{"key":"10.1016\/S0022-0000(05)80072-8_bib15","series-title":"Proceedings, First Annual Workshop on Computational Learning Theory, MIT, Cambridge","first-page":"425","article-title":"Open problems in systems that learn","author":"Jain","year":"1988"},{"key":"10.1016\/S0022-0000(05)80072-8_bib16","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\/S0022-0000(05)80072-8_bib17","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/S0022-0000(05)80072-8_bib18","series-title":"Systems That Learn; An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"Osherson","year":"1986"},{"key":"10.1016\/S0022-0000(05)80072-8_bib19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0010-0277(82)90005-1","article-title":"A note on formal learning theory","volume":"11","author":"Osherson","year":"1982","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80072-8_bib20","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\/S0022-0000(05)80072-8_bib21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(05)80072-8_bib22","article-title":"\u00dcber Eingabeabh\u00e4ngigkeit und Komplexit\u00e4t von Inferenzstrategien","author":"Sch\u00e4fer-Richter","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:04Z","timestamp":1548178024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800728"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80072-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}