2 ms·
The halting problem doesn't say that you can never prove that any given program won't ever halt, just that some programs (written in a Turing-complete language)
by icebraining 11y ago
The halting problem doesn't say that you can never prove that any given program won't ever halt, just that some programs (written in a Turing-complete language) are undecidable. You can write a program which can be proven will or won't ever halt.
But the typical solution to this particular problem is to correctly employ a watchdog[1] that will restart your program if it halts. In fact, this wifi-monitoring plug is serving as a watchdog itself.
[1] https://en.wikipedia.org/wiki/Watchdog_timer https://en.wikipedia.org/wiki/Watchdog_timer