It is shown that, for every k ≥ 0 and every fixed algorithmically random language B, there is a language that is polynomial-time, truth-table reducible in k + 1 queries to B but not truth-table reducible in k queries in any amount of time to any algorithmically random language C. In particular, this yields the separation Pk − tt(RAND) ⫅̸ P(k + 1) − tt(RAND), where RAND is the set of all
... [Show full abstract] algorithmically random languages.