Willem wrote: > stephen@nomail.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,
No, actually most decision problems are undecidable. There are countably many Turing machines (like the integers), but uncountably many decision problems (like the real numbers). Hence, virtually all decision problems are undecidable.
> it's just that it's not solvable for *all* inputs.
