The halting problem asks whether there is a procedure that takes as input a computer program and input to the program and determines whether the program will eventually stop when run with this input.
Proof by contradiction:(Turing’s proof)
Assume there is a solution to the halting problem, a procedure called H(P,I).This procedure takes two inputs, one a [...]