Kolmogorov complexity

views updated

Kolmogorov complexity (K-complexity) A theory of computational complexity based on the amount of information contained within entities. It was developed by the Russian mathematician Andrei Kolmogorov.