Journal ArticleOPEN ACCESS

Did Turing prove the undecidability of the halting problem?

Journal of Logic and Computation (2026) 36(1)
DOI: 10.1093/logcom/exaf075
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss the accuracy of the attribution commonly given to Turing (1936, Proceedings of the London Mathematical Society, 42.3, 230–265) for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion.

Cite

CITATION STYLE

APA

Hamkins, J. D., & Nenu, T. (2026). Did Turing prove the undecidability of the halting problem? Journal of Logic and Computation, 36(1). https://doi.org/10.1093/logcom/exaf075

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free