{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T01:11:16Z","timestamp":1698887476825},"reference-count":8,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T00:00:00Z","timestamp":1265846400000},"content-version":"vor","delay-in-days":10087,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Cognitive Science"],"published-print":{"date-parts":[[1982,7]]},"abstract":"<jats:p>We examine the prospects for finding \u201cbest possible\u201d or \u201cideal\u201d computing machines for various learning tasks. For this purpose, several precise senses of \u201cideal machine\u201d are considered within the context of formal learning theory. Generally negative results are provided concerning the existence of ideal learning\u2010machines in the senses considered.<\/jats:p>","DOI":"10.1207\/s15516709cog0603_3","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T13:00:03Z","timestamp":1120568403000},"page":"277-290","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Ideal Learning Machines*"],"prefix":"10.1111","volume":"6","author":[{"given":"Daniel N.","family":"Osherson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Weinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2010,2,11]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90261-2"},{"key":"e_1_2_1_3_1","volume-title":"Computability and logic","author":"Boolos G.","year":"1980"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"e_1_2_1_5_1","volume-title":"Learning strategies","author":"Osherson D.","year":"1981"},{"key":"e_1_2_1_6_1","volume-title":"Criteria of learning","author":"Osherson D.","year":"1982"},{"key":"e_1_2_1_7_1","volume-title":"Theory of recursive functions and effective computability","author":"Rogers H.","year":"1967"},{"key":"e_1_2_1_8_1","volume-title":"Formal principles of language acquisition","author":"Wexler K.","year":"1980"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(78)80010-1"}],"container-title":["Cognitive Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1207%2Fs15516709cog0603_3","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1207\/s15516709cog0603_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T19:15:21Z","timestamp":1698866121000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1207\/s15516709cog0603_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["10.1207\/s15516709cog0603_3"],"URL":"https:\/\/doi.org\/10.1207\/s15516709cog0603_3","archive":["Portico"],"relation":{},"ISSN":["0364-0213","1551-6709"],"issn-type":[{"value":"0364-0213","type":"print"},{"value":"1551-6709","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,7]]},"assertion":[{"value":"2010-02-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}