Theory of Computation (Automata)
What is Halting problem primarily used for?
- A. A finite, non-empty set of symbols used to construct strings in a formal language.
- B. A visual representation showing how an automaton moves between states based on input symbols.
- C. The undecidable problem of determining whether a given program will finish running or continue forever. ✓
- D. An abstract machine with a finite number of states used to recognize patterns in input strings.
Correct answer
C. The undecidable problem of determining whether a given program will finish running or continue forever.
Explanation
Halting problem refers to the undecidable problem of determining whether a given program will finish running or continue forever.