COMPARISON OF IDENTIFICATION CRITERIA FOR MACHINE INDUCTIVE INFERENCE
COMPARISON OF IDENTIFICATION CRITERIA FOR MACHINE INDUCTIVE INFERENCE
复制标题
DOI：
10.1016/0304-3975(83)90061-0
复制
发表时间：
1983-01-01
影响因子：
1.1
通讯作者：
SMITH, C
中科院分区：
文献类型：
--
作者：
CASE, J;SMITH, C
根据归纳推理机综合的程序中异常集的大小，描述了归纳推理机的一个自然的ωPlω+1层次，它是一系列更一般的成功判据。这些标准与文献中的其他标准进行了比较。我们的一些结果被解释为折衷结果，或者显示了某些过程固有的相对计算复杂性，而另一些结果则被从实证主义、机械论的哲学立场解释为科学哲学中的定理。运用递归函数理论的技巧，包括普通递归定理和无限递归定理。
A natural ωpLω+1 hierarchy of successively more general criteria of success for inductive inference machines is described based on the size of sets of anomalies in programs synthesized by such machines. These criteria are compared to others in the literature. Some of our results are interpreted as tradeoff results or as showing the inherent relative-computational complexity of certain processes and others are interpreted from a positivistic, mechanistic philosophical stance as theorems in philosophy of science. The techniques of recursive function theory are employed including ordinary and infinitary recursion theorems.