Original: We say that the halting problem is undecidable over Turing machines.
Simplified: This program takes program x and runs for ever if x does not run for ever.