Generalized Kolmogorov complexity in relativized separations
Document typeExternal research report
Rights accessOpen Access
We describe several developments of a technique, due to Hartmanis, that uses Kolmogorov complexity to prove the existence of relativizations separating complexity classes. The main advantage of these proofs is that they clearly show the limitations of certain classes of oracle machines and the relevance of these limitations for the proof. Such limitations refer to the extent to which the machines defining the class are able to process Kolmogorov-complex structures.
CitationGavaldà, R. [et al.]. Generalized Kolmogorov complexity in relativized separations. 1990.
Is part ofLSI-90-21