Question: A problem, say P2, can be proved undecidable if we can show a reduction of an already known undecidable problem, say P1, to P2. Why

A problem, say P2, can be proved undecidable if we can show a reduction of an already known undecidable problem, say P1, to P2. Why does changing the direction of the reduction, that is showing a reduction from P2 to P1 DOES NOT prove the undecidability of P2?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!