Kolmogorov Complexity (Algorithmic Complexity)
Natural & Formal Sciences Dictionary
Definition
For a finite binary string, the Kolmogorov complexity is the length (in bits) of the shortest program on a fixed universal Turing machine that outputs that string and then halts; it formalizes algorithmic compressibility.