![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE? |
A. | P3 is decidable if P1 is reducible to P3 |
B. | P3 is undecidable if P3 is reducible to P2 |
C. | P3 is undecidable if P2 is reducible to P3 |
D. | P3 is decidable if P3 is reducible to P2's complement |
Answer» C. P3 is undecidable if P2 is reducible to P3 |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet