A problem whose language is recursive is called? , ISRO 2011
2011
A problem whose language is recursive is called? , ISRO 2011
- A.
Unified problem
- B.
Boolean function
- C.
Recursive problem
- D.
Decidable
Attempted by 37 students.
Show answer & explanation
Correct answer: D
In computability theory, a recursive language is one for which there exists a Turing machine that halts on all inputs. This property defines a decidable problem. Therefore, a problem whose language is recursive is called Decidable.