Open In App

ISRO | ISRO CS 2011 | Question 78

Like Article
Like
Save
Share
Report

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


Last Updated : 14 May, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads