Halting Problem Undecidability
Proved by Alan Turing, this is a fundamental limit of computation.
📜
The statement of the theorem
There is no algorithm that can determine, for any given program and input, whether the program will eventually halt or run forever.
Source: Wikipedia