> mapped uniquely to a string of length of at most 2^N - 1. I think you mixed up lengths and number of values here. With 2^N - 1 it is the latter. > Of course

> mapped uniquely to a string of length of at most 2^N - 1. I think you mixed up lengths and number of values here. With 2^N - 1 it is the latter. > Of course one can also show that KC does not compress most strings by much. The problem of finding the Kolmogorov complexity of a string is undecidable, so I wonder if this statement is true.