Once again: James Gleick describes the “Kolmogorov complexity” of an object as “the size, in bits, of the shortest algorithm needed to generate it”.  In other words, a measure of how much information is stored. Gleick outlines, in quite a bit of detail, that the amount of difference (surprise) in something is equal to the … Continue reading Kolmogorov Complexity