ISRO | ISRO CS 2011 | Question 78

A problem whose language is recursive is called?
(A) Unified problem
(B) Boolean function
(C) Recursive problem
(D) Decidable

Answer: (D)
Explanation: Recursive languages are Turing Decidable whereas Recursively Enumerable languages are Turing Recognisable.
Refer: Recursive Languages
Quiz of this Question