KnowraKolmogorov complexityLinked fromLinked fromThe 16 pages that link to Kolmogorov complexity, each with the reason it gives.All 16Broader topic 2Related 8Compared with 6Computability theoryRelated: Its exact values are generally uncomputable, linking information measurement to algorithmic limits.Data compressionRelated: It gives a theoretical notion of compressibility based on the shortest description.Lossless compressionRelated: It describes an ideal, uncomputable notion of how much a particular file can be compressed.Computable functionRelated: Its uncomputability reveals limits on measuring the simplest effective description.Leonid LevinRelated: Levin’s work links universal computation and description length to algorithmic information.Unary numeral systemRelated: Unary descriptions show how representation choices affect the measured length of number-encoding programs.Minimum description lengthRelated: MDL uses computable codes to approximate this ideal measure of description length.Infinite monkey theoremRelated: A target's complexity helps quantify how unlikely it is to appear in a short random sample.