Mathematics
The Halting Problem and the Limits of Computation
Quick fact
Alan Turing proved the halting problem is undecidable in 1936, a year before the first electronic computers were even built.
Why this is interesting
Imagine you could write a program that checks any other program and tells you whether it will ever stop running. Sounds useful, right? But what if that program is impossible to build — even in theory?