The halting problem — determining whether a program will ever stop — is mathematically unsolvable, proved by Alan Turing.

Fact #5080
✨ Next Fact
👍 0 · 👎 0
Want more facts?
We have over 11,441 facts across 15 categories.
Copied!