{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T16:10:23Z","timestamp":1657901423093},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(00)00385-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:05:14Z","timestamp":1027591514000},"page":"287-308","source":"Crossref","is-referenced-by-count":11,"title":["Control structures in hypothesis spaces: the influence on learning"],"prefix":"10.1016","volume":"270","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":"78","reference":[{"key":"10.1016\/S0304-3975(00)00385-6_BIB1","series-title":"Anatomy of Lisp","author":"Allen","year":"1978"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02127967","article-title":"Learning-theoretic perspectives of acceptable numberings","volume":"17","author":"Baliga","year":"1966","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB7","series-title":"The Calculi of Lambda Conversion.","author":"Church","year":"1941"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB8","series-title":"Computability, Complexity, and Languages","author":"Davis","year":"1994"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB9","doi-asserted-by":"crossref","unstructured":"R. Freivalds, M. Karpinski, C. Smith, Co-learning of total recursive functions, Proc. 7th Ann. Conf. Comput. Learning Theory, ACM Press, New York, 1994, pp. 190\u2013197.","DOI":"10.1145\/180139.181098"},{"issue":"1","key":"10.1016\/S0304-3975(00)00385-6_BIB10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/inco.1995.1158","article-title":"On the intrinsic complexity of learning","volume":"123","author":"Freivalds","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/malq.19820282708","article-title":"Inductive inference and computable one-one numberings","volume":"28","author":"Freivalds","year":"1982","journal-title":"Zeitschr. j. math. Logik und Grundlagen d. Math. Bd."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/malq.19840300904","article-title":"Connections between identifying functionals, standardizing operations, and computable numberings","volume":"30","author":"Freivalds","year":"1984","journal-title":"Zeitschr. j. math. Logik und Grundlagen d. Math. Bd."},{"issue":"3","key":"10.1016\/S0304-3975(00)00385-6_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration","volume":"23","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","article-title":"Prudence and other conditions on formal language learning","volume":"85","author":"Fulk","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB15","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB16","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1006\/jcss.1996.0030","article-title":"The intrinsic complexity of language identification","volume":"52","author":"Jain","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB18","series-title":"Systems that Learn: An Introduction to Learning Theory","author":"Jain","year":"1999"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB19","series-title":"Proc. 9th Internat. Conf. on Machine Learning.","article-title":"Learning to fly","author":"Kedzier","year":"1992"},{"issue":"3","key":"10.1016\/S0304-3975(00)00385-6_BIB20","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.2307\/2274760","article-title":"A note on direct sums of Friedbergnumberings","volume":"54","author":"Kummer","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB21","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(93)90286-3","article-title":"Composition is almost (but not quite) as good as s-1-1","volume":"120","author":"Marcoux","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB22","series-title":"Classical Recursion Theory","author":"Odifreddi","year":"1989"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB23","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB24","unstructured":"G. Riccardi, The independence of control structures in abstract programming systems, Ph.D. Thesis, SUNY\/Buffalo, 1980."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0022-0000(81)90024-6","article-title":"The independence of control structures in abstract programming systems","volume":"22","author":"Riccardi","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB26","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB27","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967. Reprinted by MIT Press in 1987."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB28","volume":"Vol. 273","author":"Royer","year":"1987"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB29","series-title":"Subrecursive Programming Systems: Complexity & Succinctness","author":"Royer","year":"1994"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB30","series-title":"Denotational Semantics: The Scott\u2013Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB31","series-title":"Computability","author":"Weihrauch","year":"1987"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB32","doi-asserted-by":"crossref","unstructured":"R. Wiehagen, Characterization problems in the theory of inductive inference, Proc. of the 5th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978, pp. 494\u2013508.","DOI":"10.1007\/3-540-08860-1_37"},{"key":"10.1016\/S0304-3975(00)00385-6_BIB33","unstructured":"R. Wiehagen, Characterizations of learnability in various hypothesis spaces, private communication, 1996."},{"key":"10.1016\/S0304-3975(00)00385-6_BIB34","first-page":"190","article-title":"A guided tour across the boundaries of learning recursive languages","volume":"Vol. 961","author":"Zeugmann","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003856?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003856?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:25:38Z","timestamp":1578446738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397500003856"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00385-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}