email@example.com wrote: ) Noone was talking about indefinite input. The Halting Problem ) is unsolvable and there is nothing indefinite or uncertain about ) the input.
It may be interesting to mention that the halting problem is most certainly solvable for some inputs, and it might even be that it is solvable for almost all inputs, it's just that it's not solvable for *all* inputs.
The way the proof goes is to assume there is an algorithm that decides the halting problem for all its inputs and then construct another algorithm that includes it, using it to decide if it should halt or not, thus creating a paradox.
SaSW, Willem -- Disclaimer: I am in no way responsible for any of the statements made in the above text. For all I know I might be drugged or something.. No I'm not paranoid. You all think I'm paranoid, don't you ! #EOT