{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:39:47Z","timestamp":1725489587298},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_40","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:56:14Z","timestamp":1187254574000},"page":"424-433","source":"Crossref","is-referenced-by-count":0,"title":["Costs of General Purpose Learning"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"40_CR1","unstructured":"J. B\u0101rzdi\u0146\u0161. Complexity and Frequency Solution of Some Algorithmically Unsolvable Problems. PhD thesis, Novosibirsk State University, 1971. In Russian."},{"key":"40_CR2","unstructured":"J. B\u0101rzdi\u0146\u0161. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, vol. 1, pages 82\u201388. Latvian State University, 1974. In Russian."},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"40_CR5","unstructured":"K. J. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, SUNY\/Buffalo, 1981."},{"key":"40_CR6","first-page":"23","volume":"30","author":"J. Case","year":"1994","unstructured":"J. Case, S. Jain, and S. Ngo Manguelle. Refinements of inductive inference by Popperian and reliable machines. Kybernetika, 30:23\u201352, 1994.","journal-title":"Kybernetika"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"J. Case and C. Smith. Anomaly hierarchies of mechanized inductive inference. In Symposium on the Theory of Computation, pages 314\u2013319, 1978.","DOI":"10.1145\/800133.804360"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"40_CR10","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1998","unstructured":"S. Jain, D. Osherson, J. Royer, and A. Sharma. Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge, Mass., second edition edition, 1998. To appear.","edition":"second edition"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"E. Minicozzi. Some natural properties of strong identification in inductive inference. Theoretical Computer Science, pages 345\u2013360, 1976.","DOI":"10.1016\/0304-3975(76)90087-6"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, 1986.","DOI":"10.7551\/mitpress\/6609.001.0001"},{"key":"40_CR13","first-page":"68","volume-title":"Theory of Algorithms and Programs, vol. 1","author":"K. Podnieks","year":"1974","unstructured":"K. Podnieks. Comparing various concepts of function prediction, Part I. In Theory of Algorithms and Programs, vol. 1, pages 68\u201381. Latvian State University, Riga, Latvia, 1974."},{"key":"40_CR14","volume-title":"The Logic of Scientific Discovery","author":"K. Popper","year":"1968","unstructured":"K. Popper. The Logic of Scientific Discovery. Harper Torch Books, New York, second edition, 1968.","edition":"second edition"},{"key":"40_CR15","unstructured":"G. Riccardi. The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY\/Buffalo, 1980."},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","volume":"22","author":"G. Riccardi","year":"1981","unstructured":"G. Riccardi. The independence of control structures in abstract programming systems. Journal of Computer and System Sciences, 22:107\u2013143, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers. G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23:331\u2013341, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"40_CR18","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted, MIT Press 1987."},{"key":"40_CR19","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted by MIT Press in 1987."},{"key":"40_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-18253-5","volume-title":"A Connotational Theory of Program Structure","author":"J. Royer","year":"1987","unstructured":"J. Royer. A Connotational Theory of Program Structure, volume 273 of Lecture Notes in Computer Science. Springer-Verlag, 1987."}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T18:50:34Z","timestamp":1587840634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}