{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:17Z","timestamp":1725664457656},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602170"},{"type":"electronic","value":"9783540447375"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60217-8_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:50:27Z","timestamp":1330278627000},"page":"76-95","source":"Crossref","is-referenced-by-count":6,"title":["Not-so-nearly-minimal-size program inference (preliminary report)"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mandayam","family":"Suraj","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,30]]},"reference":[{"key":"5_CR1","first-page":"82","volume":"88","author":"J. M. Barzdin","year":"1974","unstructured":"J. M. Barzdin. Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs, Latvian State University, Riga, 88:82\u201388, 1974.","journal-title":"Theory of Algorithms and Programs, Latvian State University, Riga"},{"key":"5_CR2","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":"5_CR3","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":"5_CR4","volume-title":"PhD thesis","author":"K. Chen","year":"1981","unstructured":"K. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, Computer Science Department, SUNY at Buffalo, 1981."},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","volume":"52","author":"K. Chen","year":"1982","unstructured":"K. Chen. Tradeoffs in inductive inference of nearly minimal sized programs. Information and Control, 52:68\u201386, 1982.","journal-title":"Information and Control"},{"key":"5_CR6","first-page":"189","volume-title":"Journal of Computer and System Sciences","author":"J. Case","year":"1989","unstructured":"J. Case, S. Jain, and A. Sharma. Convergence to nearly minimal size grammars by vacillating learning machines. In R. Rivest, D. Haussler, and M.K. Warmuth, editors, Proceedings of the Second Annual Workshop on Computational Learning Theory, Santa Cruz, California, pages 189\u2013199. Morgan Kaufmann Publishers, Inc., August 1989. Journal version in press for Journal of Computer and System Sciences."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-28-1-11-21","volume":"28","author":"A Church","year":"1937","unstructured":"A Church and S. C. Kleene. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae, 28:11\u201321, 1937.","journal-title":"Fundamenta Mathematicae"},{"key":"5_CR8","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":"5_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF02218664","volume":"7","author":"Y. L. Ershov","year":"1968","unstructured":"Y.L. Ershov. A hierarchy of sets II. Algebra and Logic, 7:212\u2013232, 1968.","journal-title":"Algebra and Logic"},{"key":"5_CR10","first-page":"3","volume":"3","author":"R. Freivalds","year":"1977","unstructured":"R. Freivalds and E. B. Kinber. Limit identification of minimal G\u00f6del numbers. Theory of Algorithms and Programs 3;Riga 1977, pages 3\u201334, 1977.","journal-title":"Theory of Algorithms and Programs"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-07389-2_199","volume":"32","author":"R. Freivalds","year":"1975","unstructured":"R. Freivalds. Minimal G\u00f6del numbers and their identification in the limit. Lecture Notes in Computer Science, 32:219\u2013225, 1975.","journal-title":"Lecture Notes in Computer Science"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"R. Freivalds. Inductive inference of minimal programs. In M. Fulk and J. Case, editors, Proceedings of the Third Annual Workshop on Computational Learni ng Theory, pages 3\u201320. Morgan Kaufmann Publishers, Inc., August 1990.","DOI":"10.1016\/B978-1-55860-146-8.50004-7"},{"key":"5_CR13","unstructured":"R Freivalds and C. H. Smith. On the role of procrastination for machine learning. Technical Report TR-91-27, UMIACS, 1991. To appear in Information and Computation."},{"key":"5_CR14","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":"5_CR15","unstructured":"S. Jain and A. Sharma. Program size restrictions in inductive learning. In AAAI Symposium Series, Symposium: Machine Learning of Natural Language and Ontology, March 1991. Journal version accepted by Theoretical Computer Science."},{"key":"5_CR16","first-page":"221","volume":"1","author":"E. B. Kinber","year":"1974","unstructured":"E. B. Kinber. On the synthesis in the limit of almost minimal G\u00f6del numbers. Theory Of Algorithms and Programs, LSU, Riga, 1:221\u2013223, 1974.","journal-title":"Theory Of Algorithms and Programs, LSU, Riga"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-08442-8_112","volume":"56","author":"E. B. Kinber","year":"1977","unstructured":"E. B. Kinber. On a theory of inductive inference. Lecture Notes in Computer Science, 56:435\u2013440, 1977.","journal-title":"Lecture Notes in Computer Science"},{"key":"5_CR18","first-page":"35","volume":"3","author":"E. B. Kinber","year":"1977","unstructured":"E. B. Kinber. On limit identification of minimal G\u00f6del numbers for functions from enumerable classes. Theory of Algorithms and Programs 3;Riga 1977, pages 35\u201356, 1977.","journal-title":"Theory of Algorithms and Programs"},{"key":"5_CR19","first-page":"459","volume":"19","author":"E. B. Kinber","year":"1983","unstructured":"E. B. Kinber. A note on limit identification of c-minimal indices. Electronische Informationverarbeitung und Kybernetik, 19:459\u2013463, 1983.","journal-title":"Electronische Informationverarbeitung und Kybernetik"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S. C. Kleene","year":"1938","unstructured":"S. C. Kleene. Notations for ordinal numbers. Journal of Symbolic Logic, 3:150\u2013155, 1938.","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"405","DOI":"10.2307\/2372632","volume":"77","author":"S. C. Kleene","year":"1955","unstructured":"S. C. Kleene. On the forms of predicates in the theory of constructive ordinals, II. American Journal of Mathematics, 77:405\u2013428, 1955.","journal-title":"American Journal of Mathematics"},{"key":"5_CR22","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":"5_CR23","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":"5_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":"5_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":"5_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":"5_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. Mc-Graw Hill, New York, 1967. Reprinted, MIT Press, 1987."},{"key":"5_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":"5_CR29","doi-asserted-by":"crossref","unstructured":"G. E. Sacks. Higher Recursion Theory. Springer-Verlag, 1990.","DOI":"10.1007\/978-3-662-12013-2"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"342","DOI":"10.2307\/2270310","volume":"36","author":"N. Shapiro","year":"1971","unstructured":"N. Shapiro. Review of \u201cLimiting recursion\u201d by E.M. Gold and \u201cTrial and error predicates and the solution to a problem of Mostowski\u201d by H. Putnam. Journal of Symbolic Logic, 36:342, 1971.","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR31","unstructured":"W. Sierpinski. Cardinal and ordinal numbers. PWN-Polish Scientific Publishers, 1965. Second revised edition."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning for Knowledge-Based Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60217-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:30:10Z","timestamp":1640943010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60217-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602170","9783540447375"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-60217-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}