3 ms·
The fact that a particular algorithm never halts is only tangentially related to the halting problem. It's even possible to write non-halting algorithms in non
by umanwizard 10y ago
The fact that a particular algorithm never halts is only tangentially related to the halting problem.
It's even possible to write non-halting algorithms in non-Turing-complete systems for which the Halting problem doesn't hold.