Kolmogorov Complexity and Computational Complexity by Osamu Watanabe (1992)
The mathematical theory of computation has given rise to two significant approaches to the informal concept of “complexity.” Kolmogorov complexity, typically used as a measure for a single object like a string or sequence, assesses the information required to describe the object.
[Read More]