Get the latest tech news
Did Turing prove the undecidability of the halting problem?
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.
View a PDF of the paper titled Did Turing prove the undecidability of the halting problem?, by Joel David Hamkins and Theodor Nenu View PDFHTML (experimental) Abstract: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. From: Joel David Hamkins [ view email][v1] Sun, 30 Jun 2024 12:37:02 UTC (149 KB)
Or read this on Hacker News