{"title":"归纳专门知识的聚合","authors":"Daniel N. Osherson, Michael Stob, Scott Weinstein","doi":"10.1016/S0019-9958(86)80025-0","DOIUrl":null,"url":null,"abstract":"<div><p>The aggregation problem is to design an inferential agent that makes intelligent use of the theories offered by a team of inductive inference machines working in a common environment. The present paper formulates several versions of the aggregation problem and investigates them from a recursion theoretic point of view.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80025-0","citationCount":"36","resultStr":"{\"title\":\"Aggregating inductive expertise\",\"authors\":\"Daniel N. Osherson, Michael Stob, Scott Weinstein\",\"doi\":\"10.1016/S0019-9958(86)80025-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The aggregation problem is to design an inferential agent that makes intelligent use of the theories offered by a team of inductive inference machines working in a common environment. The present paper formulates several versions of the aggregation problem and investigates them from a recursion theoretic point of view.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80025-0\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800250\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
The aggregation problem is to design an inferential agent that makes intelligent use of the theories offered by a team of inductive inference machines working in a common environment. The present paper formulates several versions of the aggregation problem and investigates them from a recursion theoretic point of view.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
