Did Turing prove the undecidability of the halting problem?

Joel David Hamkins, Theodor Nenu

Journal of Logic and Computation · 2025 · 인용 5

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.

📄 이 논문을 인용한 Paperis 글

이 논문이 근거 목록에 올라 있는 Paperis 글입니다.