I am having trouble understanding the following statement regarding Turing reduction:
"If P1 is reduced to P2, then P2 is at least as hard as P1."
Does this mean that
(i) P2 can be harder or as hard as P1, or (ii) P2 can be easier or as hard as P1?
To represent this visually...
I would appreciate any insight on the matter. Thank you.