{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:11:40Z","timestamp":1648872700053},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00028-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"455-473","source":"Crossref","is-referenced-by-count":3,"title":["Costs of general purpose learning"],"prefix":"10.1016","volume":"259","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keh-Jiann","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00028-1_BIB1","unstructured":"J. B\u0101rzdi\u0146\u0161, Complexity and Frequency Solution of Some Algorithmically Unsolvable Problems, Ph.D. Thesis, Novosibirsk StateUniversity, 1971 (in Russian)."},{"key":"10.1016\/S0304-3975(00)00028-1_BIB2","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","volume":"Vol. 1","author":"B\u0101rzdi\u0146\u0161","year":"1974"},{"key":"10.1016\/S0304-3975(00)00028-1_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\/S0304-3975(00)00028-1_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. ACM"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01761704","article-title":"Periodicity in generations of automata","volume":"8","author":"Case","year":"1974","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB6","first-page":"23","article-title":"Refinements of inductive inference by Popperian and reliable machines","volume":"30","author":"Case","year":"1994","journal-title":"Kybernetika"},{"key":"10.1016\/S0304-3975(00)00028-1_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\/S0304-3975(00)00028-1_BIB8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1018920425684","article-title":"Identifying nearly minimal G\u00f6del numbers from additional information","volume":"23","author":"Freivalds","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB9","first-page":"179","article-title":"Inductive inference with additional information","volume":"15","author":"Freivalds","year":"1979","journal-title":"J. Inform. Process. Cybernet. (EIK)"},{"key":"10.1016\/S0304-3975(00)00028-1_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\/S0304-3975(00)00028-1_BIB11","series-title":"Systems that Learn","author":"Jain","year":"1999"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","article-title":"Some natural properties of strong identification in inductive inference","volume":"2","author":"Minicozzi","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00028-1_BIB13","first-page":"68","article-title":"Comparing various concepts of function prediction, Part I","volume":"Vol. 1","author":"Podnieks","year":"1974"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB14","series-title":"The Logic of Scientific Discovery","author":"Popper","year":"1968"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB15","unstructured":"G. Riccardi, The Independence of Control Structures in Abstract Programming Systems, Ph.D. Thesis, SUNY\/Buffalo, 1980."},{"key":"10.1016\/S0304-3975(00)00028-1_BIB16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","article-title":"The independence of control structures in abstract programming systems","volume":"22","author":"Riccardi","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00028-1_BIB17","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\/S0304-3975(00)00028-1_BIB18","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1987"},{"key":"10.1016\/S0304-3975(00)00028-1_BIB19","volume":"Vol. 273","author":"Royer","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T10:20:55Z","timestamp":1556792455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500000281"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00028-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}