Contra Schmidhuber's article, [Turing 1936] was correct in its statement that the proof of computational undecidability of the halting problem is very differe

Contra Schmidhuber's article, [Turing 1936] was correct in its statement that the proof of computational undecidability of the halting problem is very different from [Gödel 1931] attempted proof of inferential undecidability using the (nonexistent) proposition I'mUnprovable.