What is the main technique used by Alan Turing to prove the undecidability of the Halting Problem?

Options

  • A. Binary Search
  • B. Proof by contradiction using diagonalization
  • C. Dynamic Programming
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. Proof by contradiction using diagonalization

Detailed Explanation

  • Diagonalization: A mathematical technique used in computability theory.
  • Proof Idea: Assume a hypothetical algorithm decides whether any program halts, then construct a program whose behavior contradicts that assumption.
  • Conclusion: A general Halting Problem solver cannot exist.