{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:05Z","timestamp":1725663965396},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560043"},{"type":"electronic","value":"9783540473398"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56004-1_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:52:28Z","timestamp":1330235548000},"page":"129-139","source":"Crossref","is-referenced-by-count":0,"title":["Strong separation of learning classes"],"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":[[2005,5,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"D. Angluin and C. Smith. A survey of inductive inference: Theory and methods. Computing Surveys, 15:237\u2013289, 1983.","journal-title":"Computing Surveys"},{"key":"9_CR2","first-page":"82","volume":"210","author":"J. M. Barzdin","year":"1974","unstructured":"J. M. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974. In Russian.","journal-title":"Theory of Algorithms and Programs, Latvian State University, Riga"},{"key":"9_CR3","doi-asserted-by":"crossref","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":"9_CR4","doi-asserted-by":"crossref","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":"9_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","volume":"11","author":"M. Blum","year":"1967","unstructured":"M. Blum. On the size of machines. Information and Control, 11:257\u2013265, 1967.","journal-title":"Information and Control"},{"key":"9_CR6","unstructured":"J. M. Barzdin and K. Podnieks. The theory of inductive inference. In Mathematical Foundations of Computer Science, 1973."},{"key":"9_CR7","first-page":"15","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Periodicity in generations of automata"},{"key":"9_CR8","unstructured":"J. Case. Learning machines. In W. Demopoulos and A. Marras, editors, Language Learning and Concept Acquisition. Ablex Publishing Company, 1986."},{"key":"9_CR9","unstructured":"J. Case. The power of vacillation. In D. Haussler and L. Pitt, editors, Proceedings of the Workshop on Computational Learning Theory, pages 133\u2013142. Morgan Kaufmann Publishers, Inc., 1988."},{"key":"9_CR10","volume-title":"PhD thesis","author":"K. Chen","year":"1981","unstructured":"K. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, SUNY at Buffalo, 1981."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"J. Case, S. Jain, and A. Sharma. Complexity issues for vacillatory function identification. In Proceedings, Foundations of Software Technology and Theoretical Computer Science, Eleventh Conference, New Delhi, India. Lecture Notes in Computer Science 560, pages 121\u2013140. Springer-Verlag, December 1991.","DOI":"10.1007\/3-540-54967-6_65"},{"key":"9_CR12","volume-title":"Technical Report 152","author":"J. Case","year":"1979","unstructured":"J. Case and S. Ngo Manguelle. Refinements of inductive inference by Popperian machines. Technical Report 152, SUNY\/Buffalo, 1979."},{"key":"9_CR13","doi-asserted-by":"crossref","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":"9_CR14","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","volume":"20","author":"J. Feldman","year":"1972","unstructured":"J. Feldman. Some decidability results on grammatical inference and complexity. Information and Control, 20:244\u2013262, 1972.","journal-title":"Information and Control"},{"key":"9_CR15","volume-title":"PhD thesis","author":"M. Fulk","year":"1985","unstructured":"M. Fulk. A Study of Inductive Inference machines. PhD thesis, SUNY at Buffalo, 1985."},{"key":"9_CR16","doi-asserted-by":"crossref","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":"9_CR17","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979."},{"key":"9_CR18","volume-title":"Numerical Analysis","author":"Z. Kopal","year":"1961","unstructured":"Zdenek Kopal. Numerical Analysis. Chapman and Hall Ltd., London, 1961."},{"key":"9_CR19","doi-asserted-by":"crossref","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 \u2014 A survey. Information Sciences, 22:149\u2013169, 1980.","journal-title":"Information Sciences"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Y. Marcoux. Composition is almost as good as s-1-1. In Proceedings, Structure in Complexity Theory-Fourth Annual Conference. IEEE Computer Society Press, 1989.","DOI":"10.1109\/SCT.1989.41805"},{"key":"9_CR21","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":"9_CR22","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986."},{"key":"9_CR23","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":"9_CR24","volume-title":"PhD thesis","author":"G. Riccardi","year":"1980","unstructured":"G. Riccardi. The Independence of Control Structures in Abstract Programming Systems. PhD thesis, SUNY\/ Buffalo, 1980."},{"key":"9_CR25","doi-asserted-by":"crossref","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":"9_CR26","doi-asserted-by":"crossref","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":"9_CR27","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted. MIT Press. 1987."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"J. Royer. A Connotational Theory of Program Structure. Lecture Notes in Computer Science 273. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18253-5"},{"key":"9_CR29","volume-title":"PhD thesis","author":"R. Wiehagen","year":"1978","unstructured":"R. Wiehagen. Zur Therie der Algrithmischen Erkennung. PhD thesis, Humboldt-Universitat, Berlin, 1978."}],"container-title":["Lecture Notes in Computer Science","Analogical and Inductive Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56004-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:48:15Z","timestamp":1619556495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56004-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560043","9783540473398"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-56004-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}