{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:57:43Z","timestamp":1648907863799},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:p> Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated limit programs is also studied. To partially motivate these studies, it is shown that, in some cases, interesting global properties of computable functions can be proved from suitable (n+1)-iterated limit programs for them which can not be proved from any n-iterated limit programs for them. It is shown that learning power is increased when (n+1)-iterated limit programs rather than n-iterated limit programs are to be learned. Many trade-off results are obtained regarding learning power, number (possibly zero) of limits taken, program size constraints and information, and number of errors tolerated in final programs learned. <\/jats:p>","DOI":"10.1142\/s0129054192000097","type":"journal-article","created":{"date-parts":[[2004,11,24]],"date-time":"2004-11-24T19:50:24Z","timestamp":1101325824000},"page":"93-115","source":"Crossref","is-referenced-by-count":16,"title":["ON LEARNING LIMITING PROGRAMS"],"prefix":"10.1142","volume":"03","author":[{"given":"JOHN","family":"CASE","sequence":"first","affiliation":[{"name":"Department of Computer and Information Sciences University of Delaware Newark, DE 19716, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SANJAY","family":"JAIN","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences University of Delaware Newark, DE 19716, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ARUN","family":"SHARMA","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering The University of New South Wales Sdyney, NSW 2033, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054192000097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:51:53Z","timestamp":1565124713000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054192000097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1142\/S0129054192000097"],"URL":"https:\/\/doi.org\/10.1142\/s0129054192000097","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}