Constructive proof of uncomputability of the Halting Problem? – mathoverflow.net

As a strengthening of the uncomputability of the Halting Problem, there is a total computable function $f$ which shows where a Turing machine $M$ fails to compute the Halting problem, in that for each ...