Q.

Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is

A. P3 is decidable if P3 is reducible to compliment of P2
B. P3 is decidable if P1 is reducible to P3
C. P3 is undecidable if P1 is reducible to P3
D. P3 is undecidable if P2 is reducible to P3
Answer» D. P3 is undecidable if P2 is reducible to P3
3.7k
0
Do you find this helpful?
21

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs