Kolmogorov, Dickens and Schakespeare

It's about compressing art. is that possible ? Ask Newton ! read here...."no one would argue that they compare in anyway to Dickens, much less Shakespeare. Given that the Kolmogorov complexity is uncomputable we can never know for sure if art is compressible. So a challenge to computer scientists is to write a program that can generate literature with a program shorter than the work itself". Intrigued ?? Get the whole story...