{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:22Z","timestamp":1725664462075},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_18","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:02Z","timestamp":1330290242000},"page":"205-218","source":"Crossref","is-referenced-by-count":2,"title":["Learning with confidence"],"prefix":"10.1007","author":[{"given":"J\u0101nis","family":"B\u0101rzdi\u0146s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl H.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C. H. Smith. Inductive inference: Theory and methods. Computing Surveys, 15:237\u2013269, 1983.","journal-title":"Computing Surveys"},{"key":"18_CR2","unstructured":"D. Angluin and C. H. Smith. Inductive inference. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 409\u2013418. John Wiley and Sons Inc., 1987."},{"key":"18_CR3","volume-title":"The Continuum of Inductive Methods","author":"R. Carnap","year":"1952","unstructured":"R. Carnap. The Continuum of Inductive Methods. The University of Chicago Press, Chicago, Illinois, 1952."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-07389-2_199","volume":"32","author":"R. V. Freivalds","year":"1975","unstructured":"R. V. Freivalds. Minimal g\u00f6del numbers and their identification in the limit. Lecture Notes in Computer Science, 32:219\u2013225, 1975.","journal-title":"Lecture Notes in Computer Science"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"R. Freivalds. Inductive inference of minimal size programs. In M. Fulk and J. Case, editors, Proceedings of the third Annual Workshop on Computational Learning Theory, pages 1\u201320. Morgan Kaufman, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50004-7"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"R. Freivalds. Inductive inference of recursive functions: Qualitative theory. In J. B\u0101rzdins and D. Bj\u00f8rner, editors, Baltic Computer Science, pages 77\u2013110. Springer Verlag, 1991. Lecture Notes in Computer Science, Vol. 502.","DOI":"10.1007\/BFb0019357"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. Friedberg","year":"1958","unstructured":"R. Friedberg. Three theorems on recursive enumeration. Journal of Symbolic Logic, 23:309\u2013316, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"18_CR8","first-page":"39","volume-title":"The Undecidable","author":"K. G\u00f6del","year":"1965","unstructured":"K. G\u00f6del. On undecidable propositions of formal mathematical systems. In M. Davis, editor, The Undecidable, pages 39\u201373. Raven Press, Hewlett, N.Y., 1965."},{"key":"18_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":"18_CR10","first-page":"35","volume-title":"Theory Of Algorithms and Programs, number 3","author":"E. B. Kinber","year":"1977","unstructured":"E. B. Kinber. On identification in the limit of minimal numbers for functions of effectively enumerable classes. In Barzdins, editor, Theory Of Algorithms and Programs, number 3, pages 35\u201356. Latvian State University, Riga, U.S.S.R., 1977."},{"key":"18_CR11","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North-Holland, New York, 1978."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"C. Smith. A Recursive Introduction to the Theory of Computation. Springer-Verlag, 1994.","DOI":"10.1007\/978-1-4419-8501-9"},{"issue":"11","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1984.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:32Z","timestamp":1605646952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}