Complicated complementations

Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. Using Kolmogorov complexity for oracle construction, we obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov arguments almost trivializes the construction itself: In particular we construct relativized worlds where: 1. NP∩CoNP∈P/poly. 2. NP has a set that is both simple and NP∩CoNP-immune. 3. CoNP has a set that is both simple and NP∩CoNP-immune. 4. Π₂^p has a set that is both simple and Π₂^p∩Σ^2p-immune