halting problem term
you cannot write a program that decides if any program halts
Turing's foundational undecidability proof. Practically: static analysis, type checkers, infinite loop detection all run into halting-problem limits. 'It reduces to the halting problem' = it's impossible in general.