#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If a problem can be shown that it belongs to the class of recursively enumerable languages then ______________________.
Answer
It may be solved by any TM
It may be solved by any TM