|
Not Ranked
:
+0 / -0
0 score
Re: Halting Undecidability proof faulty?
Hi, I've mentioned this a couple times before, but it bears repeating.
There is NOTHING in the proof for the Undecidability of the Halting Problem that says that the Halting program has to run on itself, or that it must simulate or emulate the execution of the copy of itself, or that it must mess around with recursion, or for that matter, ANY other technique.
The Halting Problem is more inclusive than that. It doesn't CARE what technique or algorithm or trick is used to determine that some arbitrary program will or will not halt, The method is NEVER declared.
This is what makes the proof work!!!! You just assume that your program WORKS. You don't CARE how it does it. Then, assuming your program works, you follow the logic and confront a contradiction.
The contradiction means your assumption was wrong.
All these arguments here about how the program "has" to work, just muddy the water and confuse the issue.
----------------
Hypography Forums Moderator
-- - - - - -
What concerns me is not the way things are, but rather the way people think things are.
Epictetus, Greek Philosopher
The map is NOT the territory.
Korzybski, Polish-American Philosopher
|
