{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T11:17:20Z","timestamp":1649071040575},"reference-count":35,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":7224,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1994,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A <jats:italic>generator program<\/jats:italic> for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of generator programs for computable functions is studied. To motivate these studies partially, it is shown that, in some cases, interesting global properties for computable functions can be proved from suitable generator programs which <jats:italic>cannot<\/jats:italic> be proved from <jats:italic>any<\/jats:italic> ordinary programs for them. The power (for variants of various learning criteria from the literature) of learning generator programs is compared with the power of learning ordinary programs. The learning power in these cases is also compared to that of learning <jats:italic>limiting programs<\/jats:italic>, i.e., programs allowed finitely many mind changes about their correct outputs.<\/jats:p>","DOI":"10.2307\/2275402","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:51:53Z","timestamp":1146941513000},"page":"486-500","source":"Crossref","is-referenced-by-count":7,"title":["Machine learning of higher-order programs"],"prefix":"10.1017","volume":"59","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":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200019927_ref035","unstructured":"Wiehagen R. , Zur Theorie der Algorithmischen Erkennung, Ph.D. Thesis, Hunboldt-Universitat, Berlin, 1978."},{"key":"S0022481200019927_ref034","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0022481200019927_ref033","volume-title":"Degrees of unsolvability","author":"Shoenfield","year":"1971"},{"key":"S0022481200019927_ref031","first-page":"342","volume":"36","author":"Shapiro","year":"1971","journal-title":"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"},{"key":"S0022481200019927_ref029","volume-title":"Theory of recursive functions and effective computability","author":"Rogers","year":"1967"},{"key":"S0022481200019927_ref030","volume-title":"Subrecursion: functions and hierarchies","author":"Rose","year":"1984"},{"key":"S0022481200019927_ref027","first-page":"140","article-title":"Provably recursive functions","volume":"63","author":"Rogers","year":"1957","journal-title":"Bulletin of the American Mathematical Society"},{"key":"S0022481200019927_ref026","volume-title":"Intensional subrecursion and complexity theory","author":"Royer","year":"1992"},{"key":"S0022481200019927_ref025","first-page":"49","volume":"30","author":"Putnam","year":"1965","journal-title":"Trial and error predicates and the solution to a problem of Mostowski"},{"key":"S0022481200019927_ref022","volume-title":"Introduction to mathematical logic","author":"Mendelson","year":"1986"},{"key":"S0022481200019927_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(80)80006-5"},{"key":"S0022481200019927_ref019","first-page":"155","volume":"23","author":"Kreisel","year":"1958","journal-title":"Mathematical significance of consistency proofs"},{"key":"S0022481200019927_ref017","volume-title":"Introduction to automata theory languages and computation","author":"Hopcroft","year":"1979"},{"key":"S0022481200019927_ref016","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"S0022481200019927_ref015","first-page":"28","volume":"30","author":"Gold","year":"1965","journal-title":"Limiting recursion"},{"key":"S0022481200019927_ref014","unstructured":"Fulk M. , A study of inductive inference machines, Ph.D. Thesis, State University of New York at Buffalo, Buffalo, New York, 1985."},{"key":"S0022481200019927_ref013","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0175771-6"},{"key":"S0022481200019927_ref012","doi-asserted-by":"publisher","DOI":"10.4064\/fm-49-1-35-92"},{"key":"S0022481200019927_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012761"},{"key":"S0022481200019927_ref008","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054192000097"},{"key":"S0022481200019927_ref006","volume-title":"Language learning and concept acquistion","author":"Case","year":"1986"},{"key":"S0022481200019927_ref004","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321395"},{"key":"S0022481200019927_ref010","first-page":"30","volume":"18","author":"Craig","year":"1953","journal-title":"On axiomatizability within a system"},{"key":"S0022481200019927_ref002","first-page":"82","article-title":"Two theorems on the limiting synthesis of functions","volume":"210","author":"Barzdin","year":"1974","journal-title":"Theory of algorithms and programs"},{"key":"S0022481200019927_ref024","volume-title":"Systems that learn, an introduction to learning theory for cognitive and computer scientists","author":"Osherson","year":"1986"},{"key":"S0022481200019927_ref001","doi-asserted-by":"publisher","DOI":"10.1145\/356914.356918"},{"key":"S0022481200019927_ref028","first-page":"331","volume":"23","author":"Rogers","year":"1958","journal-title":"G\u00f6del numberings of partial recursive functions"},{"key":"S0022481200019927_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90061-0"},{"key":"S0022481200019927_ref018","first-page":"241","volume":"17","author":"Kreisel","year":"1951","journal-title":"On the interpretation of nonfinitist proofs"},{"key":"S0022481200019927_ref023","volume-title":"An introduction to the general theory of algorithms","author":"Machtey","year":"1978"},{"key":"S0022481200019927_ref021","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1976-0403933-6"},{"key":"S0022481200019927_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/BF01761704"},{"key":"S0022481200019927_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90261-2"},{"key":"S0022481200019927_ref032","doi-asserted-by":"publisher","DOI":"10.2307\/1970028"},{"key":"S0022481200019927_ref007","unstructured":"Chen K. , Tradeoffs in machine inductive inference, Ph.D. Thesis, State University of New York at Buffalo, Buffalo, New York, 1981."}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200019927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:31Z","timestamp":1557878431000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200019927\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["S0022481200019927"],"URL":"https:\/\/doi.org\/10.2307\/2275402","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}