Joel David Hamkins and Theodor Nenu, “Did Turing prove the undecidability of the halting problem?”, 18 pages, 2024, Mathematics arXiv:2407.00680.

**Abstract.** We discuss the accuracy of the attribution commonly given to Turing (1936) for the computable undecidability of the halting problem, eventually coming to a nuanced conclusion.

The *halting problem* is the decision problem of determining whether a given computer program halts on a given input, a problem famously known to be computably undecidable. In the computability theory literature, one quite commonly finds attribution for this result given to Alan Turing (1936), and we should like to consider the extent to which these attributions are accurate. After all, the term *halting problem*, the modern formulation of the problem, as well as the common self-referential proof of its undecidability, are all—strictly speaking—absent from Turing’s work. However, Turing does introduce the concept of an undecidable decision problem, proving that what he calls the circle-free problem is undecidable and subsequently also that what we call the symbol-printing problem, to decide if a given program will ever print a given symbol, is undecidable. This latter problem is easily seen to be computably equivalent to the halting problem and can arguably serve in diverse contexts and applications in place of the halting problem—they are easily translated to one another. Furthermore, Turing laid down an extensive framework of ideas sufficient for the contemporary analysis of the halting problem, including: the definition of Turing machines; the labeling of programs by numbers in a way that enables programs to be enumerated and also for them to be given as input to other programs; the existence of a universal computer; the undecidability of several problems that, like the halting problem, take other programs as input, including the circle-free problem, the symbol-printing problem, and the infinite-symbol-printing problem, as well as the Hilbert-Ackermann Entscheidungsproblem. In light of these facts, and considering some general cultural observations, by which mathematical attributions are often made not strictly for the exact content of original work, but also generously in many cases for the further aggregative insights to which those ideas directly gave rise, ultimately we do not find it unreasonable to offer qualified attribution to Turing for the undecidability of the halting problem. That said, we also find it incorrect to suggest that one will find a discussion of the halting problem or a proof of its undecidability in Turing (1936).

Read the full paper at the mathematics arxiv:2407.00680. (pdf download available)

**Bibliography**

- A. M. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42.3 (1936), pp. 230–265. doi:10.1112/plms/s2-42.1.230.

Pingback: 图灵证明了停机问题的不可判定性吗？ - 偏执的码农

This is a very nice paper, yet it remains unclear whether Turing would have endorsed Martin Davis’s “halting problem” (e.g., in connection with computing, broadly construed). For more history, please consider having a look at:

https://www.dijkstrascry.com/lecture3

Purely technically, I would like to suggest that there is (actually) more than one way to go from Turing’s a-machines to halting machines. Davis only gave us one way, and there is (again) no reason to believe that Turing was not more open minded about the issue at hand. Please consider perusing these results: https://www.dijkstrascry.com/RBM