Recursive languages are also known as:
(a) decidable
(b) undecidable
(c) sometimes decidable
(d) none of the mentioned
I have been asked this question by my school teacher while I was bunking the class.
This question is from The Universal Language-Undecidability in section Undecidability of Automata Theory