Simplify the following text for a Grade 7 native English-speaking person.
Original: Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs can not exist . We say that the halting problem is undecidable over Turing machines .
Simplified: This is clearly impossible and was used by Alan Turing in 1936 to prove that there is no program that solves the halting problem .