What is meant by undecidable problem in Theory of Automata and Formal Languages?

Correct Answer: D

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

The correct answer is a decision problem for which no algorithm halts with correct yes/no answers for all inputs.