Incompressible string

An incompressible string is a string with Kolmogorov complexity equal to its length, so that it has no shorter encodings. The pigeonhole principle can be used to be prove that for any lossless compression algorithm, there must exist many incompressible strings.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.