 A popular proof of HALT? goes as follows. Assume that HALT? is computable. Then it should be possible to construct a Turing machine which decides, for each machine \(T_i\) and some input w for \(T_i\) whether or not \(T_i\) will halt on w. Let us call this machine \(T_{H}\). More particularly, we have: