Original sentence: Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.Jack Copeland (2004) attributes the actual term halting problem to Martin Davis.We say that the halting problem is undecidable over Turing machines
Edited sentence: Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist, and so the halting problem is undecidable.The actual term halting problem has sometimes been attributed to Martin Davis