For that reason, there are cases where "A" is bounded Turing reducible to "B" but not weak truth-table reducible to "B". The strong reductions listed above restrict the manner in which oracle information can be accessed by a decision procedure but do not otherwise limit the computational resources available. Thus if a set "A" is decidable then "A" is reducible to any set "B" under any of the strong reducibility relations listed above, even if "A" is not polynomial-time or exponential-time decidable. This is acceptable in the study of recursion theory, which is interested in theoretical computability, but it is not reasonable for computational complexity theory, which studies which sets can be decided under certain asymptotical resource bounds. The most common reducibility in computational complexity theory is polynomial-time reducibility; a set "A" is polynomial-time reducible to a set "B" if there is a polynomial-time function "f" such that for every "n", "n" is in "A" if and only if "f"("n") is in "B". This reducibility is, essentially, a resource-bounded version of many-one reducibility. Other resource-bounded reducibilities are used in other contexts of computational complexity theory where other resource bounds are of interest. Although Turing reducibility is the most general reducibility that is effective, weaker reducibility relations are commonly studied. These reducibilities are related to relative definability of sets over arithmetic or set theory. They include: