Did Turing prove the undecidability of the halting problem?

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.

Authors

Institutions

Publication Details

Journal
Journal of Logic and Computation
Published
2025-11-28
DOI
https://doi.org/10.1093/logcom/exaf075
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Did Turing prove the undecidability of the halting problem?

Theodor Nenu, Joel David Hamkins
Journal of Logic and Computation
Computability, Logic, AI Algorithms
article

Did Turing prove the undecidability of the halting problem?

Theodor Nenu, Joel David Hamkins
article en

Abstract

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.

Journal of Logic and ComputationVol. 36(1)
University of Notre Dame (US), Wellcome Centre for Ethics and Humanities (GB)
Openalex Percentile: Top 25%
Computability, Logic, AI Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Did Turing prove the undecidability of the halting problem? — Theodor Nenu, Joel David Hamkins · Journal of Logic and Computation (2025) | TGRS Research Map | TGRS