论归纳推理的复杂性

Q4 Mathematics 信息与控制 Pub Date : 1986-04-01 DOI:10.1016/S0019-9958(86)80042-0

Robert P. Daley, Carl H. Smith

{"title":"论归纳推理的复杂性","authors":"Robert P. Daley, Carl H. Smith","doi":"10.1016/S0019-9958(86)80042-0","DOIUrl":null,"url":null,"abstract":"<div><p>The notion of the complexity of performing an inductive inference is defined. Some examples of the tradeoffs between the complexity of performing an inference and the accuracy of the inferred result are presented. An axiomatization of the notion of the complexity of inductive inference is developed and several results are presented which both resemble and contrast with results obtainable for the axiomatic computational complexity of recursive functions.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1986-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80042-0","citationCount":"34","resultStr":"{\"title\":\"On the complexity of inductive inference\",\"authors\":\"Robert P. Daley, Carl H. Smith\",\"doi\":\"10.1016/S0019-9958(86)80042-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The notion of the complexity of performing an inductive inference is defined. Some examples of the tradeoffs between the complexity of performing an inference and the accuracy of the inferred result are presented. An axiomatization of the notion of the complexity of inductive inference is developed and several results are presented which both resemble and contrast with results obtainable for the axiomatic computational complexity of recursive functions.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80042-0\",\"citationCount\":\"34\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995886800420\",\"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/S0019995886800420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 34

摘要

定义了执行归纳推理的复杂性的概念。给出了在执行推理的复杂性和推断结果的准确性之间进行权衡的一些例子。本文提出了归纳推理复杂性概念的公理化，并给出了几个与递归函数公理化计算复杂性的结果相似或相反的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the complexity of inductive inference

The notion of the complexity of performing an inductive inference is defined. Some examples of the tradeoffs between the complexity of performing an inference and the accuracy of the inferred result are presented. An axiomatization of the notion of the complexity of inductive inference is developed and several results are presented which both resemble and contrast with results obtainable for the axiomatic computational complexity of recursive functions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊