{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:43:12Z","timestamp":1648878192105},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"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":[[1996,9]]},"DOI":"10.1016\/0304-3975(95)00154-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"13-28","source":"Crossref","is-referenced-by-count":1,"title":["Anomalous learning helps succinctness"],"prefix":"10.1016","volume":"164","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00154-9_BIB1","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\/0304-3975(95)00154-9_BIB2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00154-9_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. Control"},{"key":"10.1016\/0304-3975(95)00154-9_BIB4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1995.1013","article-title":"Complexity issues for vacillatory function identification","volume":"116","author":"Case","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00154-9_BIB5","article-title":"Not-so-nearly-minimal-size program inference","author":"Case","year":"1994"},{"key":"10.1016\/0304-3975(95)00154-9_BIB6","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\/0304-3975(95)00154-9_BIB7","article-title":"Tradeoffs in machine inductive inference","author":"Chen","year":"1981"},{"key":"10.1016\/0304-3975(95)00154-9_BIB8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","article-title":"Tradeoffs in inductive inference of nearly minimal sized programs","volume":"52","author":"Chen","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00154-9_BIB9","series-title":"The Calculi of Lambda Conversion","author":"Church","year":"1941"},{"key":"10.1016\/0304-3975(95)00154-9_BIB10","first-page":"219","article-title":"Minimal G\u00f6del numbers and their identification in the limit","volume":"Vol. 32","author":"Freivalds","year":"1975"},{"key":"10.1016\/0304-3975(95)00154-9_BIB11","series-title":"Theory of Algorithms and Programs 3; Riga 1977","first-page":"3","article-title":"Limit identification of minimal G\u00f6del numbers","author":"Freivalds","year":"1977"},{"key":"10.1016\/0304-3975(95)00154-9_BIB12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1006\/inco.1994.1084","article-title":"Approximate inference and scientific method","volume":"114","author":"Fulk","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00154-9_BIB13","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. Control"},{"key":"10.1016\/0304-3975(95)00154-9_BIB14","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0304-3975(94)90047-7","article-title":"Program size restrictions in computational learning","volume":"127","author":"Jain","year":"1994","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/0304-3975(95)00154-9_BIB15","first-page":"459","article-title":"A note on limit identification of c-minimal indices","volume":"19","author":"Kinber","year":"1983","journal-title":"Electronische Inform. Kybernetik"},{"key":"10.1016\/0304-3975(95)00154-9_BIB16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","article-title":"An introduction to Kolmogorov complexity and its applications","author":"Li","year":"1993"},{"key":"10.1016\/0304-3975(95)00154-9_BIB17","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(95)00154-9_BIB18","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0019-9958(72)90592-X","article-title":"Program size in restricted programming languages","volume":"21","author":"Meyer","year":"1972","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00154-9_BIB19","series-title":"Symp. on the Theory of Computation","article-title":"Program size and economy of description","author":"Meyer","year":"1972"},{"key":"10.1016\/0304-3975(95)00154-9_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\/0304-3975(95)00154-9_BIB21","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(95)00154-9_BIB22","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/S0019-9958(86)80002-X","article-title":"Inductive inference of approximations","volume":"70","author":"Royer","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(95)00154-9_BIB23","article-title":"Progressions of relatively succinct programs in subrecursive hierarchies","author":"Royer","year":"1986"},{"key":"10.1016\/0304-3975(95)00154-9_BIB24","series-title":"Progress in Theoretical Computer Science","article-title":"Subrecursive Programming Systems: Complexity and Succinctness","author":"Royer","year":"1994"},{"key":"10.1016\/0304-3975(95)00154-9_BIB25","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2307\/2270310","article-title":"Review of \u201cLimiting recursion\u201d by E.M. Gold and \u201cTrial and error predicates and the solution to a problem of Mostowski\u201d by H. Putnam","volume":"36","author":"Shapiro","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00154-9_BIB26","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","article-title":"On degrees of unsolvability","volume":"69","author":"Shoenfield","year":"1959","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(95)00154-9_BIB27","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"},{"key":"10.1016\/0304-3975(95)00154-9_BIB28","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001549?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001549?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:57:58Z","timestamp":1556301478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0304397595001549"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00154-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}