Theory of Computation MCQ: Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is | Extra Education

← All Theory of Computation questions

1

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

Correct Answer: P3 is undecidable if P2 is reducible to P3

Make the most of this question

This page focuses on one Theory of Computation question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Theory of Computation MCQ: Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is undecidable. The statement that holds true is | Extra Education