8 8 votes A problem whose language is recursion is called? Unified problem Boolean function Recursive problem Decidable Theory of Computation isro2011 theory-of-computation recursive-and-recursively-enumerable-languages + – go_editor 5.5k views answer comment Share Follow Print See 1 comment 1 1 comment reply Sidd1425 commented Jan 23, 2025 reply Follow flag @Deepak Poonia what is the significance of this question?Recursion that's why recursive? Any standard resource for this? 0 0 replyShare Please log in or register to add a comment.
Best answer 14 14 votes A problem whose language is recursion is called Decidable (Recursive Language) Kapil answered Jun 24, 2016 • selected Jun 24, 2016 by Arjun Kapil comment Share Follow See 1 comment 1 1 comment reply Saransh Maurya commented Dec 4, 2024 reply Follow flag ok 0 0 replyShare Please log in or register to add a comment.
2 2 votes It will call Recursive Problems. Recursive problem is decidable. Hence it is decidable srestha answered Jun 24, 2016 • edited Jun 24, 2016 by srestha srestha comment Share Follow See 1 comment 1 1 comment reply `JEET commented Jan 7, 2020 reply Follow flag Recursive problem Decidable Both are the options then what to do? 0 0 replyShare Please log in or register to add a comment.
2 2 votes ans is (d) Decidable: If the problem and its complement are both semidecidable (or recursively enumerable), then the problem is decidable (recursive). Undecidable: If the problem is semidecidable and its complement is not semidecidable (that is, is not recursively enumerable). kvkumar answered Jun 26, 2016 kvkumar comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Since the program has recursion it uses an algorithm so by Church Turing thesis its a recursivelanguage and decidable DeadMann answered Apr 18, 2023 DeadMann comment Share Follow 0 reply Please log in or register to add a comment.
