Given any collection of Turing machine instructions together with any initial tape contents, deciding whether that Turing machine will ever halt if started on that tape. proof by contradiction. Assume the opposite of what you want to prove and follow the logical consequences until you reach a contradiction, thereby showing that your assumption is incorrect. recognizer. A Turing machine that.