Kolmogorov complexity inequality

54 Views Asked by At

Prove, that KP (x) ≤ KS (x) + log KS(x) + 2 log log KS (x) + O(1).

Please tell me in which direction to think.