 The difference between bounded weak truth-table and bounded Turing reduction is that in the first case, the up to "n" queries have to be made at the same time while in the second case, the queries can be made one after the other.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.