{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:04:19Z","timestamp":1725480259024},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667483"},{"type":"electronic","value":"9783540467694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46769-6_22","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:42:39Z","timestamp":1172666559000},"page":"264-275","source":"Crossref","is-referenced-by-count":0,"title":["Learnability of Enumerable Classes of Recursive Functions from \u201cTypical\u201d Examples"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Nessel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Jain, S., Lange, S., Nessel, J. (1997), Learning of r.e. Languages from Good Examples, in Li, Maruoka, Eds., Eighth International Workshop on Algorithmic Learning Theory, 32\u201347, Lecture Notes in Artificial Intelligence 1316, Springer Verlag.","DOI":"10.1007\/3-540-63577-7_34"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(93)90353-U","volume":"110","author":"R. Freivalds","year":"1993","unstructured":"Freivalds, R., Kinber, E.B., Wiehagen, R. (1993), On the power of inductive inference from good examples. Theoretical Computer Science 110, 131\u2013144.","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M. (1967), Language identification in the limit. Information and Control 10, 447\u2013474.","journal-title":"Information and Control"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jcss.1996.0020","volume":"52","author":"S.A. Goldman","year":"1996","unstructured":"Goldman, S.A., Mathias, H.D. (1996), Teaching a smarter learner. Journal of Computer and System Sciences 52, 255\u2013267.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(95)00036-C","volume":"54","author":"M. Kummer","year":"1995","unstructured":"Kummer, M. (1995), A Learning-Theoretic Characterization of Classes of Recursive Functions, Information Processing Letters 54, 205\u2013211.","journal-title":"Information Processing Letters"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1018955906119","volume":"23","author":"S. Lange","year":"1998","unstructured":"Lange, S., Nessel, J., Wiehagen, R. (1998), Learning recursive languages from good examples, Annals of Mathematics and Artificial Intelligence 23, 27\u201352.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Lange, S., Zeugmann, T. (1993), Language Learning in Dependence on the Space of Hypotheses, Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 127\u2013136, ACM Press.","DOI":"10.1145\/168304.168320"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1142\/S0129054193000110","volume":"2","author":"S. Lange","year":"1993","unstructured":"Lange, S., Zeugmann, T. (1993), Learning recursive languages with bounded mindchanges, International Journal of Foundations of Computer Science 2, 157\u2013178.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/BF02330746","volume":"11","author":"S. S. Marchenkov","year":"1972","unstructured":"Marchenkov, S. S. (1972), The computable enumerations of families of recursive functions, Algebra i Logika 11, 588\u2013607; English Translation Algebra and Logic 15, 128\u2013141, 1972.","journal-title":"Algebra i Logika"},{"key":"22_CR10","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers, H. Jr. (1987), Theory of Recursive Functions and Effective Computability, MIT Press, Cambridge, Massachusetts."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46769-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T00:19:48Z","timestamp":1556151588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46769-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667483","9783540467694"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46769-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}