UNDECIDABILITY OF TURING MACHINE IMMORTALITY PROBLEM

被引：57

|

作者：

HOOPER, PK

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1966年 / 31卷 / 02期

关键词：

D O I：

10.2307/2269811

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：219 / &

相关论文

共 50 条

[1] Undecidability: The history and time of the universal Turing machine
Mackenzie, A
[J]. CONFIGURATIONS, 1996, 4 (03) : 359 - 379
[2] IMMORTALITY PROBLEM FOR NONERASING TURING MACHINES
BELSNES, D
[J]. JOURNAL OF SYMBOLIC LOGIC, 1971, 36 (02) : 380 - &
[3] Turing Machines Connected to the Undecidability of the Halting Problem
L. M. Pavlotskaya
[J]. Mathematical Notes, 2002, 71 : 667 - 675
[4] On Turing's proof of the undecidability of the halting problem
Ferreira, U
[J]. MSV'04 & AMCS'04, PROCEEDINGS, 2004, : 519 - 522
[5] Turing machines connected to the undecidability of the halting problem
Pavlotskaya, LM
[J]. MATHEMATICAL NOTES, 2002, 71 (5-6) : 667 - 675
[6] DEFREE OF UNSOLVABILITY OF TURING MACHINE IMMORTALITY PROBLEMS
FISCHER, PC
[J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 17 (01): : 209 - &
[7] On the Generic Undecidability of the Halting Problem for Normalized Turing Machines
Rybalov, Alexander
[J]. THEORY OF COMPUTING SYSTEMS, 2017, 60 (04) : 671 - 676
[8] On the Generic Undecidability of the Halting Problem for Normalized Turing Machines
Alexander Rybalov
[J]. Theory of Computing Systems, 2017, 60 : 671 - 676
[9] Undecidability of the speed positiveness problem in reversible and complete Turing machines
Torres-Aviles, Rodrigo
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 121 : 49 - 56
[10] A SIMPLE SOLUTION OF TURING MACHINE UNIFORM HALTING PROBLEM
HERMAN, GT
[J]. JOURNAL OF SYMBOLIC LOGIC, 1970, 35 (01) : 179 - &

← 1 2 3 4 5 →