Dark Mode

Intekhab Ahmad
asked
in Theory of Computation
Nov 16, 2021

69 views
0 votes

If P1 is reducible to P2,

then what does it exactly mean?

What should we assume

- ) P1 is a subset of P2

or

b.) P2 is a subset of P1

Please answer within the accordance that

- If P1 is decidable then P2 may be decidable or undecidable.
- If P1 is undecidable then P2 is also Undecidable.
- If P2 is Undecidable then P1 may be decidable or undecidable.
- If P2 is Decidable then P1 will be definitly Decidable.