计算机技术与发展2016，Vol.26Issue(12)：64-68,5.DOI:10.3969/j.issn.1673-629X.2016.12.014
图灵的停机问题及其对角线证法研究
Research on Turing’ s Halting Problem and Diagonal Method
摘要
Abstract
Halting problem is one of the most classical ones in computer science,which has been considered unresoluable. The methods of testification on the unresolvability of halting problem are composed of diagonal proof and that of program,in which the former is a stretch of canter’s diagonal method. By deep study on Cantor’s diagonal method,Turing’s unresolvable proofs of the halting problem,and both the program proof and the diagonal proof,the essence of the program proof is revealed. It is pointed out that without loss of its original function, the judge program may exist. In addition,the essential deficiency and fault of the diagonal method,both Cantor’ s and Tuting’ s,is revealed.关键词
康托尔/对角线/停机问题/图灵/不可解问题Key words
Cantor/diagonal/halting problem/turing/unresolvable problems分类
信息技术与安全科学引用本文复制引用
杜立智,陈和平,符海东..图灵的停机问题及其对角线证法研究[J].计算机技术与发展,2016,26(12):64-68,5.基金项目
2014年湖北省自然科学基金项目(2014CFC1121) （2014CFC1121）
