EUVIMEDObjevte EUVIMED
Open access · CC BY 4.0

Did Turing prove the undecidability of the halting problem?

Joel David Hamkins, Theodor Nenu

Journal of Logic and Computation · 2026-01-08 · 36 (1)

DOI: 10.1093/logcom/exaf075 ↗

At a glance

Journal article in Journal of Logic and Computation, published online on 2026-01-08. Written by Joel David Hamkins and 1 co-authors. Cited 2 times so far (Crossref); 34 references. The full text is freely available (open access, CC BY 4.0).

AbstraktBibliografické údajeCiteRelated studies

Abstract (original language)

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

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

Vancouver

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

BibTeX
@article{Hamkins2026,
  author = {Hamkins, Joel David and Nenu, Theodor},
  title = {Did Turing prove the undecidability of the halting problem?},
  journal = {Journal of Logic and Computation},
  year = {2026},
  volume = {36},
  number = {1},
  doi = {10.1093/logcom/exaf075}
}
Start for free →