Read the article, this is a circumvention rather than compression, although if you define Komogorov-randomness appropriately, such a definition would work. But

Read the article, this is a circumvention rather than compression, although if you define Komogorov-randomness appropriately, such a definition would work. But modern OS's have non-determinism available: take a Kolmogorov-random file of size n which can be generated by a program n+1. Then, replace a certain part of the program (totaling k bits, and delete 2 extra bits) with a function drawing k+2 random bits from the OS. Then with probability 2^-(k+2), you win.