Which language class is also known as recursively enumerable?

Explanation:
Turing-recognizable (recursively enumerable) languages can be accepted by a Turing Machine.

Latest Blogs