The Kolmogorov complexity (also known as algorithmic complexity and algorithmic entropy) of an object is the length of the shortest program that generates it.
The Kolmogorov complexity (also known as algorithmic complexity and algorithmic entropy) of an object is the length of the shortest program that generates it.