Science Forums 2

[CraigD]

Originally Posted by Pyrotex

I guess the only recourse is to go read the original Turing Proof, or a good "wikipedia" version of it.

Or read my recent humble presentation of the subject, “A short description of Turing machines and a halting problem undecidability proof”.

I’ve seen many excellent description of Turing machines, and of Turing’s halting problem undecidability proof, but can’t recall any that combine the two, and are text-based, rather than graphical (sketches), so decided to write my own.

Graphical presentations, while arguably easier to follow, can, I think lead to some confusion about the basic “mechanics” of Turing machines.

This webpage, which I linked to in post #8, is one of may good graphical summary of the proof I’ve seen.