|
|
|
|
|
|
by sharkbot
1119 days ago
|
|
|
Incorrect. The program under inspection could halt or could not halt; undecidability is a statement about Turing machines inspecting that program and unable to make a determination (via a clever proof by contradiction). The Halting Problem is a truly interesting result, and for the most part uninteresting in practice. |
|
|