# Are there strings with known Kolmogorov complexity?

I just looked into Kolmogorov complexity today and it appears to me that for a binary string of length $1$ (ex. '$0$') the Kolmogorov complexity must be $0$.

It follows that Kolmogorov complexity may not be computable in general but there must be some strings for which Kolmogorov complexity is trivially computed.

Is this correct?

• Kolmogorov Complexity deals with algorithms. You can't have an algorithm of length 1. – theDoctor Jun 14 '16 at 13:45