91Ó°ÊÓ

The Three Halting (3-Halt) problem is the problem of giving a decision procedure to determine whether or not an arbitrarily chosen Turing Machine halts for an input of three strokes on an otherwise blank tape. Prove that the 3 -Halt problem is unsolvable.

Show that if the halting problem is solvable for Turing machine and input pairs \(M_{e}\) and \(n\) where \(e \neq n,\) then it is also solvable for the cases where \(e=n\).