{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:51Z","timestamp":1759638411453},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341052"},{"type":"electronic","value":"9783642341069"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34106-9_8","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T05:56:27Z","timestamp":1349070987000},"page":"51-65","source":"Crossref","is-referenced-by-count":3,"title":["Confident and Consistent Partial Learning of Recursive Functions"],"prefix":"10.1007","author":[{"given":"Ziyuan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol.\u00a01, pp. 82\u201388. Latvian State University (1974) (in Russian)"},{"key":"#cr-split#-8_CR2.1","unstructured":"B\u0101rzdi\u0146\u0161, J.: Inductive inference of automata, functions and programs. In: Proceedings of the 20th International Congress of Mathematicians, Vancouver, pp. 455-560 (1974) (in Russian)"},{"key":"#cr-split#-8_CR2.2","unstructured":"English translation in American Mathematical Society Translations: Series 2 109, 107-112 (1977)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Control\u00a028, 125\u2013155 (1975)","journal-title":"Information and Control"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","volume":"20","author":"J. Feldman","year":"1972","unstructured":"Feldman, J.: Some decidability results on grammatical inference and complexity. Information and Control\u00a020, 244\u2013262 (1972)","journal-title":"Information and Control"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-27654-5_10","volume-title":"Computation, Physics and Beyond","author":"Z. Gao","year":"2012","unstructured":"Gao, Z., Stephan, F., Wu, G., Yamamoto, A.: Learning Families of Closed Sets in Matroids. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds.) WTCS 2012 (Calude Festschrift). LNCS, vol.\u00a07160, pp. 120\u2013139. Springer, Heidelberg (2012)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Mark Gold","year":"1967","unstructured":"Mark Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"issue":"1-3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2008.02.022","volume":"397","author":"G. Grieser","year":"2008","unstructured":"Grieser, G.: Reflective inductive inference of recursive functions. Theoretical Computer Science A\u00a0397(1-3), 57\u201369 (2008)","journal-title":"Theoretical Computer Science A"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0002-9904-1975-13747-5","volume":"81","author":"W. Hanf","year":"1975","unstructured":"Hanf, W.: The Boolean algebra of logic. Bulletin of the American Mathematical Society\u00a081, 587\u2013589 (1975)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"8_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that learn: an introduction to learning theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that learn: an introduction to learning theory. MIT Press, Cambridge (1999)"},{"key":"8_CR10","unstructured":"Jain, S., Stephan, F.: Consistent partial identification. In: COLT 2009, pp. 135\u2013145 (2009)"},{"key":"8_CR11","first-page":"33","volume":"173","author":"C.G. Jockusch Jr.","year":"1972","unstructured":"Jockusch Jr., C.G., Soare, R.I.: $\\prod^0_1$ classes and degrees of theories. Transactions of the American Mathematical Society\u00a0173, 33\u201356 (1972)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0039-3681(74)90007-7","volume":"4","author":"I. Lakatos","year":"1974","unstructured":"Lakatos, I.: The role of crucial experiments in science. Studies in History and Philosophy of Science\u00a04(4), 319\u2013320 (1974)","journal-title":"Studies in History and Philosophy of Science"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0026301","volume-title":"CSL\u201988","author":"M. Kummer","year":"1989","unstructured":"Kummer, M.: Numberings of $\\mathcal{R}_1\\cup F$ . In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1988. LNCS, vol.\u00a0385, pp. 166\u2013186. Springer, Heidelberg (1989)"},{"key":"8_CR14","volume-title":"Systems that learn: an introduction to learning theory for cognitive and computer scientists","author":"D.N. Osherson","year":"1986","unstructured":"Osherson, D.N., Stob, M., Weinstein, S.: Systems that learn: an introduction to learning theory for cognitive and computer scientists. MIT Press, Cambridge (1986)"},{"key":"8_CR15","volume-title":"The logic of scientific discovery","author":"K.R. Popper","year":"1959","unstructured":"Popper, K.R.: The logic of scientific discovery. Hutchinson, London (1959)"},{"key":"8_CR16","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers Jr.","year":"1987","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. MIT Press, Cambridge (1987)"},{"key":"8_CR17","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60217-8_1","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"R. Wiehagen","year":"1995","unstructured":"Wiehagen, R., Zeugmann, T.: Learning and Consistency. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol.\u00a0961, pp. 1\u201324. Springer, Heidelberg (1995)"},{"issue":"1-3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2008.02.021","volume":"397","author":"T. Zeugmann","year":"2008","unstructured":"Zeugmann, T., Zilles, S.: Learning recursive functions: a survey. Theoretical Computer Science\u00a0397(1-3), 4\u201356 (2008)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34106-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:45:02Z","timestamp":1620132302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34106-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341052","9783642341069"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34106-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}