{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:51Z","timestamp":1725455631761},"publisher-location":"Berlin\/Heidelberg","reference-count":30,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540557075"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023859","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:02:35Z","timestamp":1132362155000},"page":"9-20","source":"Crossref","is-referenced-by-count":1,"title":["Machine learning of higher order programs"],"prefix":"10.1007","author":[{"given":"Ganesh","family":"Baliga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Case","sequence":"additional","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","reference":[{"key":"2_CR1","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. A survey of inductive inference: Theory and methods. Computing Surveys, 15:237\u2013289, 1983.","journal-title":"Computing Surveys"},{"key":"2_CR2","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J. A. Barzdin","year":"1974","unstructured":"J. A. Barzdin. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Latvian State University, Riga, 210:82\u201388, 1974."},{"key":"2_CR3","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. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"2_CR4","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":"2_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"2_CR6","unstructured":"J. Case. Learning machines. In W. Demopoulos and A. Marras, editors, Language Learning and Concept Acquisition. Ablex Publishing Company, 1986."},{"key":"2_CR7","volume-title":"PhD thesis","author":"K. Chen","year":"1981","unstructured":"K. Chen. Tradeoffs in Machine Inductive Inference. PhD thesis, SUNY at Buffalo, 1981."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J. Case, S. Jain, and A. Sharma. On learning limiting programs. International Journal on Foundations of Computer Science, 1992. To appear.","DOI":"10.1142\/S0129054192000097"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0012761","volume":"140","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. Lecture Notes in Computer Science, 140:107\u2013115, 1982.","journal-title":"Lecture Notes in Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"30","DOI":"10.2307\/2266324","volume":"18","author":"W. Craig","year":"1953","unstructured":"W. Craig. On axiomatizability within a system. Journal of Symbolic Logic, 18:30\u201332, 1953.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR11","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":"2_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4064\/fm-49-1-35-92","volume":"49","author":"S. Feferman","year":"1960","unstructured":"S. Feferman. Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae, 49:35\u201392, 1960.","journal-title":"Fundamenta Mathematicae"},{"key":"2_CR13","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":"2_CR14","doi-asserted-by":"crossref","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E. M. Gold","year":"1965","unstructured":"E. M. Gold. Limiting recursion. Journal of Symbolic Logic, 30:28\u201348, 1965.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR15","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":"2_CR16","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979."},{"key":"2_CR17","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":"2_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0002-9947-1976-0403933-6","volume":"220","author":"N. Lynch","year":"1976","unstructured":"N. Lynch, A. Meyer, and M. Fischer. Relativization of the theory of computational complexity. Transactions of the American Mathematical Society, 220:243\u2013287, 1976.","journal-title":"Transactions of the American Mathematical Society"},{"key":"2_CR19","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1986","unstructured":"E. Mendelson. Introduction to Mathematical Logic. Brooks-Cole, San Francisco, 1986."},{"key":"2_CR20","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":"2_CR21","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":"2_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/2270581","volume":"30","author":"H. Putnam","year":"1965","unstructured":"H. Putnam. Trial and error predicates and the solution to a problem of Mostowski. Journal of Symbolic Logic, 30:49\u201357, 1965.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR23","unstructured":"J. Royer and J. Case. Intensional Subrecursion and Complexity Theory. Research Notes in Theoretical Science. Pitman Press, being revised for expected publication, 1992."},{"key":"2_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":"2_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."},{"key":"2_CR26","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":"2_CR27","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","volume":"69","author":"J. Shoenfield","year":"1959","unstructured":"J. Shoenfield. On degrees of unsolvability. Annals of Mathematics, 69:644\u2013653, 1959.","journal-title":"Annals of Mathematics"},{"key":"2_CR28","unstructured":"J. Shoenfield. Degrees of Unsolvability. North-Holland, 1971."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"R. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"2_CR30","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","Logical Foundations of Computer Science \u2014 Tver '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023859.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:50:54Z","timestamp":1607532654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540557075"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0023859","relation":{},"subject":[]}}