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.
最后,本文描述了科學發(fā)現(xiàn)機器的結(jié)構(gòu),并在文獻的基礎上,描述了一種同時具有發(fā)生與評價功能的歸納發(fā)現(xiàn)機器并論證了它的合理性。
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.
首先; 根據(jù)Hume 問題不可解原理和局部歸納理論(Shier; J.;1993);本文提出開放世界預設和弱封閉世界預設;前者揭示了開放類的第一個特征: 開放類擴展后得到的新成員可能不具有它原有成員借以相互區(qū)別的任何性質(zhì);
domain of unsolvability
不可解域
degree of unsolvability
不可解度
algorithmic unsolvability
算法不可解性