unsolvability

基本解释

On the basis of principle of unsolvability of Hume's problem, we elucide that it is fesible to establish a inductive machine of discovery.
最后,本文描述了科学发现机器的结构,并在文献的基础上,描述了一种同时具有发生与评价功能的归纳发现机器并论证了它的合理性。
First, according to the principle of the unsolvability of Hume's Problem and the local justification of induction(Shier, J., 1993), the Open-World Assumption and the Weak Closed-World Assumption are given.
首先; 根据Hume 问题不可解原理和局部归纳理论(Shier; J.;1993);本文提出开放世界预设和弱封闭世界预设;前者揭示了开放类的第一个特征: 开放类扩展后得到的新成员可能不具有它原有成员借以相互区别的任何性质;
domain of unsolvability
不可解域
degree of unsolvability
不可解度
algorithmic unsolvability
算法不可解性