On Four Non-Computable Decision Problems

摘要：

　　In this paper, we restudy busy beaver problem that is defined by Tibor Rado in 1962.Based on his work, we describe four decision problems-busy beaver problerr, max shifter problem, halting empty tape problem, halting problem and prove the Turing equivalence of them by reducing one problem to another under Turing computability.It has been proved that halting problem is non-computable, so we show that all these four problems are non-computable.

关键词： Turing machine Turing computability Turing reduction Halting problem Busy beaver

作者: Kun Wang Nan Wu Fangmin Song

作者单位: State Key Laboratory for Novel Software Technology,Department of Computer Science and Technology,Nanjing University,Nanjing 210023,China

会议类型: 国内会议

会议名称: 2015全国理论计算机科学学术年会

会议地点: 金华

会议语种:英文

页码: 1-13

在线出版日期: 2015-10-30（万方平台首次上网日期，不代表论文的发表时间）