算法、图灵机、哥德尔定理与知识的不确定性

The Uncertainty of Knowledge in Algorithm, Turing Machine and Gidel′s Theorems

知识论一直在寻求对知识的确定性作一般算法式的逻辑证明的辩护。然而 ,即使在处理抽象的数量概念的数学基础研究中 ,也不能达到最终逻辑证明的确定性。图灵对停机问题的算法步骤的否定回答、哥德尔定理对真理的“不可证明性”的确立 。

Epistemology keeps seeking for the certainty of knowledge in defence of logical algorithm.However,we cannot reach the destination of certainty of logical justification ever in the foundational mathematical researches concerning the abstract digital concepts.Turing gave a negative answer to the algorithm steps about the problem of stopping machine.G*idel′s theorems proved that“truth is unproveable”.All this makes us be realistic of uncertainty of the logical justification.