Did Turing prove the undecidability of the halting problem?
Joel David HamkinsTheodor Nenu
所有作者
Joel David HamkinsTheodor Nenu
文献摘要
We discuss the accuracy of the attribution commonly given to Turing’s 1936 paper “On computable numbers…” for the computable undecidability of the halting problem, coming eventually to a nuanced conclusion.