#kolmogorov
1 post · all tags
-
· Kolmogorov Complexity
Think of Kolmogorov Complexity as a way to measure the complexity of a string (a sequence of characters) by looking at the length of the shortest possible program that can produce that string. Imagine you have a super-efficient computer program that generates text. Kolmogorov Complexity is about finding the tiniest program that can spit out the exact text you have.