Quote:
Originally Posted by Kriminal99
The halting problem most definitely DOES involve a machine operating on the encoding of another machine, which it would then trace the computations of.
|
No, that is an assumption on your part!
Determining the termination of a program can proceed by a deconstruction of the logical structure of the code itself. Or do you have some reason to insist that this is not a possible approach to constructing a Halting Program? If you have no evidence or theory to back up this assertion, its simply an unsupported assumption on your part.
There is nothing in the theorem that requires tracing whatsoever: again you tar the theory for doing exactly what you insist on doing to disprove it!
Not everything that is faced can be changed, but nothing can be changed until it is faced,
Buffy
