0 votes 0 votes Complement of an undecidable problem is undecidable. Complement of decidable problem is ____________ ? Theory of Computation theory-of-computation + – abhinowKatore asked Feb 14, 2022 retagged Jun 4, 2022 by Arjun abhinowKatore 147 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shoto commented Feb 14, 2022 reply Follow Share Decidable A problem is decidable iff both the problem and its compliment is decidable. 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes A problem is decidable mean, that comes under recursive language which always halt. Recursive language closed under complement, so answer should be Decidable. amitraj123 answered Feb 23, 2022 selected Jun 24, 2022 by abhinowKatore amitraj123 comment Share Follow See all 0 reply Please log in or register to add a comment.