#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

What is an undecidable problem?

Answer

When a TM cannot make a decision on an instance of the problem