Kolmogorov Complexity

cs math

The Kolmogorov Complexity of some object (e.g. a sequence of bits) is the length of the shortest program that generates it.

Fractal structures like the ones explored Quadtree Grammars have a high “visual complexity” but can be created with very short computer programs.


If you have an idea how this page could be improved or a comment send me a mail.