Kolmogorov characterizations of complexity classes
The paper uses the notion of (resource-bounded) Kolmogorov-complexity to characterize the classes \(\Theta_ k^ p=P(\Sigma_ k^ p)\)- with logarithmically many queries to the oracle. The notion of pronouncements (query answer) of an oracle machine is introduced. Its Kolmogorov complexity determines whether classes of the polynomial-time hierarchy collapse.
scientific article; zbMATH DE number 4201620