Dan said:

> No. And I should probably clarify what I wrote, because I may have
> used nomenclature in a non-standard manner (the nomenclature was used
> from memory). By "Universal Turing Machine, I define a machine that
> can determine when every other Turing machine will stop.

That is very non-standard nomenclature. Almost everyone else uses
"Universal Turing Machine" to mean a Turing machine that can simulate
any other. Its input is some encoding of the structure of a Turing
machine and an integer and it will produce an output identical to the
operation of that second machine on the integer. I don't recall the
"halting prediction" machine having a special name.

Rich
GCU I Used To Know All About This Stuff

Reply via email to