In an automata or formal-language problem, which option best represents undecidable problem?

Correct Answer: A

a decision problem for which no algorithm halts with correct yes/no answers for all inputs

In this course context, undecidable problem means a decision problem for which no algorithm halts with correct yes/no answers for all inputs.