The class of recursively ennumerable language is known as:
(a) Turing Class
(b) Recursive Languages
(c) Universal Languages
(d) RE
I got this question at a job interview.
This intriguing question originated from The Language of Turing Machine-2 in portion Introduction to Turing Machines of Automata Theory