Technology
The Halting Problem and the Limits of Computability
Quick fact
The halting problem is so undecidable that even a supercomputer of any size could never solve it, because its impossibility is a fundamental property of logic, not just technology.
Why this is interesting
Imagine you had a magic app that could flawlessly detect whether any computer program would ever stop running or run forever. Would you be able to create it? Alan Turing proved that no such app can ever exist, no matter how powerful the computer.