{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:39:51Z","timestamp":1743118791991,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_18","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"219-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning How to Separate"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0304-3975(99)00005-5","volume":"220","author":"A. Ambainis","year":"1999","unstructured":"A. Ambainis, S. Jain, and A. Sharma. Ordinal mind change complexity of language identification. Theoretical Computer Science, 220(2):323\u2013343, 1999.","journal-title":"Theoretical Computer Science"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C. Smith. Inductive inference: Theory and methods. Computing Surveys, 15:237\u2013289, 1983.","journal-title":"Computing Surveys"},{"key":"18_CR3","first-page":"82","volume":"1","author":"J. B\u0101rzdi\u0146\u0161","year":"1974","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.","journal-title":"Theory of Algorithms and Programs"},{"key":"18_CR4","first-page":"1224","volume":"13","author":"J. B\u0101rzdi\u0146\u0161","year":"1972","unstructured":"J. B\u0101rzdi\u0146\u0161 and R. Freivalds. On the prediction of general recursive functions. Soviet Mathematics Doklady, 13:1224\u20131228, 1972.","journal-title":"Soviet Mathematics Doklady"},{"key":"18_CR5","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. Towarda mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"18_CR6","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":"18_CR7","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 andreliable machines. Kybernetika, 30:23\u201352, 1994.","journal-title":"Kybernetika"},{"key":"18_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Machine inductive inference andlanguage identification","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference andlanguage identification. In M. Nielsen and E. M. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 107\u2013115. Springer-Verlag, 1982."},{"key":"18_CR9","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":"18_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M. Fulk","year":"1990","unstructured":"M. Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85:1\u201311, 1990.","journal-title":"Information and Computation"},{"key":"18_CR11","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_CR12","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"18_CR13","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":"S. Jain, D. Osherson, J. Royer, and A. Sharma. Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge, Mass., second edition, 1999.","edition":"second edition"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"S. Jain and F. Stephan. Learning how to separate. Technical Report Forschungsberichte Mathematische Logik 51\/2001, Mathematical Institute, University of Heidelberg, 2001.","DOI":"10.1007\/3-540-45583-3_18"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.4153\/CJM-1972-113-9","volume":"24","author":"C. Jockusch","year":"1972","unstructured":"C. Jockusch. Degrees in which recursive sets are uniformly recursive. Candadian Journal of Mathematics, 24:1092\u20131099, 1972.","journal-title":"Candadian Journal of Mathematics"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/inco.1995.1170","volume":"123","author":"E. Kinber","year":"1995","unstructured":"E. Kinber and F. Stephan. Language learning from texts: Mindc hanges, limited memory and monotonicity. Information and Computation, 123:224\u2013241, 1995.","journal-title":"Information and Computation"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0020-0255(80)80006-5","volume":"22","author":"R. Klette","year":"1980","unstructured":"R. Klette and R. Wiehagen. Research in the theory of inductive inference by GDR mathematicians-A survey. Information Sciences, 22:149\u2013169, 1980.","journal-title":"Information Sciences"},{"key":"18_CR18","unstructured":"M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"E. Minicozzi. Some natural properties of strong identification in inductive inference. Theoretical Computer Science, 2:345\u2013360, 1976.","journal-title":"Theoretical Computer Science"},{"key":"18_CR20","unstructured":"P. Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989."},{"key":"18_CR21","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":"18_CR22","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprintedb y MIT Press in 1987."},{"key":"18_CR23","unstructured":"G. Sch\u00e4fer-Richter. \u00dcber Eingabeabhangigkeit und Komplexit\u00e4t von Inferenzstrategien. PhD thesis, RWTH Aachen, 1984."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"A. Sharma, F. Stephan, and Y. Ventsov. Generalizednotions of mindc hange complexity. In Proceedings of the Tenth Annual Conference on Computational Learning Theory, pages 96\u2013108. ACM Press, 1997.","DOI":"10.1145\/267460.267485"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"F. Stephan and T. Zeugmann. On the uniform learnability of approximations to non-recursive functions. In O. Watanabe and T. Yokomori, editors, Algorithmic Learning Theory: Tenth International Conference (ALT\u2019 99), volume 1720 of Lecture Notes in Artificial Intelligence, pages 276\u2013290. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46769-6_23"},{"key":"18_CR26","unstructured":"K. Wexler and P. Culicover. Formal Principles of Language Acquisition. MIT Press, 1980."},{"key":"18_CR27","first-page":"421","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"R. Wiehagen and W. Liepe. Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Journal of Information Processing and Cybernetics (EIK), 12:421\u2013438, 1976.","journal-title":"Journal of Information Processing and Cybernetics (EIK)"},{"key":"18_CR28","series-title":"Lect Notes Comput Sci","first-page":"220","volume-title":"On B\u0101rzdi\u0146\u0161\u2019 conjecture","author":"T. Zeugmann","year":"1986","unstructured":"T. Zeugmann. On B\u0101rzdi\u0146\u0161\u2019 conjecture. In K. P. Jantke, editor, Analogical and Inductive Inference, Proceedings of the International Workshop, volume 265 of Lecture Notes in Computer Science, pages 220\u2013227. Springer-Verlag, 1986."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T23:02:19Z","timestamp":1629932539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}