EUVIMEDEUVIMED entdecken
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 · 08.01.2026 · 36 (1)

DOI: 10.1093/logcom/exaf075 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 08.01.2026. Verfasst von Joel David Hamkins und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

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}
}
Kostenlos starten →