Complexity analysis for algorithmically simple strings

Andrei N. Soklakov

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functi…