Y
Hacker News
new
|
ask
|
show
|
jobs
by
remram
1444 days ago
No. Knowing whether programs end in finite time (dependent on input) doesn't mean all programs end or that all programs end in constant time.
The halting problem is also not considered unsolved (though P=NP is unsolved).