An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity

TL;DR

This paper refines Kolmogorov complexity techniques to construct an oracle where a Lipton conjecture is false, advancing understanding of deterministic versus nondeterministic time separation.

Contribution

It introduces a strengthened method using Kolmogorov complexity to refute a conjecture of Lipton via oracle construction.

Findings

Constructed an oracle where Lipton's conjecture fails

Extended Hartmanis's approach to stronger results

Provided new insights into complexity class separations

Abstract

Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an oracle relative to which a conjecture of Lipton is false.