A problem whose language is recursion is called? ( ISRO 2011 )

A problem whose language is recursion is called?

A. Unified problem
B. Boolean function
C. Recursive problem
D.Decidable

4Comments
Sourav Mishra @sourav
25 May 2016 12:56 pm

Recursive languages are Turing Decidable.

Hence the answer should be D. Decidable

Hradesh @hradeshpatel
25 May 2016 02:06 pm

kk....why other 3 option is incorrect...

 

Sourav Mishra @sourav
25 May 2016 02:14 pm

Unified problem and Recursive problem never heard of them and dont know what do they mean.

Now, coming to Boolean function there is no mention of any boolean logic.

It is given, a problem whose language is recursion (hence Recursive language)

techtud official @techtud
6 Jun 2019 06:39 pm
See, they are clearly mentioning that language is recursive, and we know that recursive language is the language of Halting Turing Machine, and so they are decidable.