Such a statement implies that an abstract machine which solves problems in "A" achieves no additional power if it is given the ability to solve problems in "B" at unit cost. In particular, this means that if "B" is low for "A" then "B" is contained in "A". Informally, lowness means that problems in "B" are not only solvable by machines which can solve problems in "A", but are “easy to solve”. An "A" machine can simulate many oracle queries to "B" without exceeding its resource bounds.