Given two problems, is it always possible to reduce one of them to another?

40 Views Asked by At

Suppose we are given two problems $A$ and $B$ (both are solvable). Is it always possible to transform one of it to another? That means whether holds $A \preceq B, B \preceq A, or A \equiv B$. This should be possible, if $A$ and $B$ are NP problems, but is it still possible, if A and B are not from NP?

Thanks in advance!