Which of the following is an example of an undecidable problem?

Options

  • A. Checking whether a number is prime
  • B. Sorting a list of integers
  • C. Halting Problem
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. Halting Problem

Detailed Explanation

  • Halting Problem: It is undecidable because no general algorithm can determine whether every arbitrary program halts on a given input.
  • Primality Testing: Decidable and can be performed in polynomial time.
  • Sorting: A decidable computational problem.
  • Exam Point: Undecidable means no algorithm exists that solves every instance correctly and terminates.