Definition
A measure of how short the shortest program that produces a given output would be.
The length of the minimal description of a string in some universal programming language, used as a formal notion of informational content; underlies the Algorithmic Lovelace Bound on closed-loop novelty.