6 marks · CO5 · AnalyseQuestion Bank #81 · Module 5 · Problems computers cannot solve
Answer in prose
Prove that HALT = {(M, w) : the Turing machine M halts on input w} is undecidable.
Marked by handThis is a prose question — no honest automatic grader exists for it, so the tool does not pretend to have one. Write your answer as you would in the exam, then use the hints to check yourself.