Input (grade 8): We say that the halting problem is undecidable over Turing machines.
Output (grade 6): This program takes program x and runs for ever if x does not run for ever.