The Global Power of Additional Queries to Random Oracles
Date
1993-02-09
Authors
Lutz, Jack
Martin, David
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Research Projects
Organizational Units
Organizational Unit
Journal Issue
Is Version Of
Versions
Series
Department
Computer Science
Abstract
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 aprticular, this yields the separation P (RAND) is a proper subset of P (RAND), k-tt (k+1)-tt where RAND is the set of all algorithmically random languages.