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

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Theory of Computation

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

💬 Discuss

✅ Correct Answer: (D) P3 is undecidable if P2 is reducible to P3

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

426

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate