Kolmogorov-Chaitin complexity
The K-C complexity is a function K(s) that assigns a single, natural number to each finite binary string s
- This number is the minimum length of a program p that generates s when run on a Universal Turing machine U
- K(s) is the algorithmic information content of s
- The algorithm constructs s by running a program p on U
K(s) is an uncomputable function