The [Church 1935] proof of the computational undecidability of the halting problem is essentially the same as the [Turing 1936] proof. Consequently, the arti

The [Church 1935] proof of the computational undecidability of the halting problem is essentially the same as the [Turing 1936] proof. Consequently, the article under discussion would be better titled "Church/Turing Uncomputability".