{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:13Z","timestamp":1725664993626},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626855"},{"type":"electronic","value":"9783540684312"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62685-9_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:47:19Z","timestamp":1330296439000},"page":"286-300","source":"Crossref","is-referenced-by-count":1,"title":["Control structures in hypothesis spaces: The influence on learning"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mandayam","family":"Suraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"24_CR1","volume-title":"Anatomy of Lisp","author":"J. Allen","year":"1978","unstructured":"J. Allen. Anatomy of Lisp. McGraw-Hill, New York, NY, 1978."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117\u2013135, 1980.","journal-title":"Information and Control"},{"key":"24_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"},{"unstructured":"G. Baliga and A. Shende. Learning-theoretic perspectives of acceptable numberings. In Third International Symposium on Artificial Intelligence and Mathematics, January 1994.","key":"24_CR5"},{"unstructured":"A. Church. The Calculi of Lambda Conversion. Princeton Univ. Press, 1941.","key":"24_CR6"},{"doi-asserted-by":"crossref","unstructured":"D. Kedzier C. Sammut, S. Hurst and D. Michie. Learning to fly. In D. Sleeman and P. Edwards, editors, Proceedings of the Ninth International Conference on Machine Learning. Morgan Kaufmann, 1992.","key":"24_CR7","DOI":"10.1016\/B978-1-55860-247-2.50055-3"},{"doi-asserted-by":"crossref","unstructured":"M. Davis, R. Sigal, and E. Weyuker. Computability, Complexity, and Languages. Academic Press, second edition, 1994.","key":"24_CR8","DOI":"10.1016\/B978-0-08-050246-5.50020-9"},{"key":"24_CR9","first-page":"190","volume-title":"Co-learning of total recursive functions","author":"R. Freivalds","year":"1994","unstructured":"R. Freivalds, M. Karpinski, and C. H. Smith. Co-learning of total recursive functions. In Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, New Jersey, pages 190\u2013197. ACM-Press, July 1994."},{"doi-asserted-by":"crossref","unstructured":"R Freivalds, E. Kinber, and C. H. Smith. On the intrinsic complexity of learning. In Paul Vitanyi, editor, Proceedings of the Second European Conference on Computational Lear ning Theory, pages 154\u2013169. Springer-Verlag, March 1995. Lecture Notes in Artificial Intelligence 904.","key":"24_CR10","DOI":"10.1007\/3-540-59119-2_175"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/malq.19820282708","volume":"28","author":"R. Freivalds","year":"1982","unstructured":"R. Freivalds, E. Kinber, and R. Wiehagen. Inductive inference and computable one-one numberings. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, 28:463\u2013479, 1982.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"24_CR12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/malq.19840300904","volume":"30","author":"R. Freivalds","year":"1984","unstructured":"R. Freivalds, E. Kinber, and R. Wiehagen. Connections between identifying functionals, standardizing operations, and computable numberings. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik, 30:145\u2013164, 1984.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"issue":"3","key":"24_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. M. Friedberg","year":"1958","unstructured":"R. M. Friedberg. Three theorems on recursive enumeration. Journal of Symbolic Logic, 23(3):309\u2013316, September 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"E. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979.","key":"24_CR15"},{"key":"24_CR16","first-page":"278","volume-title":"On the intrinsic complexity of language identification","author":"S. Jain","year":"1994","unstructured":"S. Jain and A. Sharma. On the intrinsic complexity of language identification. In Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, New Jersey, pages 278\u2013286. ACM-Press, July 1994."},{"issue":"3","key":"24_CR17","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.2307\/2274760","volume":"54","author":"M. Kummer","year":"1989","unstructured":"M. Kummer. A note on direct sums of friedbergnumberings. Journal of Symbolic Logic, 54(3): 1009\u20131010, September 1989.","journal-title":"Journal of Symbolic Logic"},{"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.","key":"24_CR18","DOI":"10.1109\/SCT.1989.41805"},{"key":"24_CR19","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1989","unstructured":"P. Odifreddi. Classical Recursion Theory, volume 125 of Studies in Logic and the Foundations of Mathematics. North Holland, Amsterdam, 1989."},{"key":"24_CR20","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":"24_CR21","volume-title":"C4.5: Programs for Machine Learning","author":"J. Quinlan","year":"1992","unstructured":"J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo, CA, 1992."},{"key":"24_CR22","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":"24_CR23","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":"24_CR24","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":"24_CR25","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."},{"doi-asserted-by":"crossref","unstructured":"J. Royer. A Connotational Theory of Program Structure. Lecture Notes in Computer Science 273. Springer Verlag, 1987.","key":"24_CR26","DOI":"10.1007\/3-540-18253-5"},{"unstructured":"J. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.","key":"24_CR27"},{"doi-asserted-by":"crossref","unstructured":"K. Weihrauch. Computability. Springer-Verlag, 1987.","key":"24_CR28","DOI":"10.1007\/978-3-642-69965-8"},{"key":"24_CR29","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-08860-1_37","volume":"62","author":"R. Wiehagen","year":"1978","unstructured":"R. Wiehagen. Characterization problems in the theory of inductive inference. Lecture Notes in Computer Science, 62:494\u2013508, 1978.","journal-title":"Lecture Notes in Computer Science"},{"unstructured":"R. Wiehagen. Characterizations of learnability in various hypothesis spaces. Private communication, 1996.","key":"24_CR30"},{"doi-asserted-by":"crossref","unstructured":"T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 190\u2013258. Springer-Verlag, 1995.","key":"24_CR31","DOI":"10.1007\/3-540-60217-8_12"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62685-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:54Z","timestamp":1605647634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62685-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626855","9783540684312"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-62685-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}