||
It is also possible to make a similar analysis of the deductive method, that is to say, of formal axiom systems. This is accomplished by analyzing more carefully the new version of Berry's paradox that was presented. Here we only sketch the three basic results that are obtained in this manner. (See the Appendix).
In a formal system with n bits of axioms it is impossible to prove that a particular binary string is of complexity greater than n+c.
Contrariwise, there are formal systems with n+c bits of axioms in which it is possible to determine each string of complexity less than n and the complexity of each of these strings, and it is also possible to exhibit each string of complexity greater than or equal to n, but without being able to know by how much the complexity of each of these strings exceeds n.
Unfortunately, any formal system in which it is possible to determine each string of complexity less than n has either one grave problem or another. Either it has few bits of axioms and needs incredibly long proofs, or it has short proofs but an incredibly great number of bits of axioms. We say “incredibly”' because these quantities increase more quickly than any computable function of n.
见:Gregory J. Chaitin. Information-Theoretic Computational Complexity. IEEE Transactions on Information Theory, IT-20 (1974), pp. 10-15.
以上内容,定有错误。看在真理的份上,请您指正!谢谢!
管窥蠡测
出自:东汉·班固《汉书·东方朔传》:“以管窥天,以蠡测海,以莛撞钟,岂能通其条贯,考其文理,发其音声哉。”
相关链接:
[1] 《中国“科学网大学”逻辑基础研讨中心》活动之一:逻辑基础资源
http://bbs.sciencenet.cn/home.php?mod=space&uid=107667&do=blog&id=430666
http://bbs.sciencenet.cn/home.php?mod=space&uid=107667&do=blog&id=440876
http://blog.sciencenet.cn/home.php?mod=space&uid=107667&do=blog&id=301287
Archiver|手机版|科学网 ( 京ICP备07017567号-12 )
GMT+8, 2024-11-19 12:15
Powered by ScienceNet.cn
Copyright © 2007- 中国科学报社