Did Turing prove the undecidability of the halting problem?

Autor:	Hamkins, Joel David, Nenu, Theodor
Rok vydání:	2024
Předmět:	Mathematics - Logic Computer Science - Logic in Computer Science
Druh dokumentu:	Working Paper
Popis:	We discuss the accuracy of the attribution commonly given to Turing's 1936 paper "On computable numbers..." for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion. Comment: 18 pages. Commentary may be made on the first author's blog at https://jdh.hamkins.org/turing-halting-problem
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2407.00680 Zobrazit plný text záznamu View this record from Arxiv