Question
In an automata or formal-language problem, which option best represents undecidable problem?
Select an option. Your answer will be checked instantly.
Correct Answer: A. a decision problem for which no algorithm halts with correct yes/no answers for all inputs
Explanation:
In this course context, undecidable problem means a decision problem for which no algorithm halts with correct yes/no answers for all inputs.
Leave a Reply