3 ms·
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 probl
by remram 4y 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).