3 ms·
Why is that surprising? The proof that the HP is unsolvable is based on showing that, if there were a solution, it would fail on one specific input.
by jibal 8y ago
Why is that surprising? The proof that the HP is unsolvable is based on showing that, if there were a solution, it would fail on one specific input.
- kevinventullo 8y agoYeah, I would imagine almost all Turing machines have trivial behavior in some way. To make a more concrete analogy, almost all C++ programs don't compile, and so HP is solvable for them in some degenerate sense.