An interesting and apparently naive question:

Is the Kolmogorov complexity of any string equally low?
https://math.stackexchange.com/questions/4335542/is-the-kolmogorov-complexity-of-any-string-equally-low

No matter what encoding scheme you specify, there will always be, for all n, some string of ≤n bits which requires ≥n bits to encode. This follows inexorably from the pidgeonhole principle.

#complexity #pattern_recognition #kolmogorov #compression #computability