A question on Kolmogorov Complexity

645 Views Asked by At

Is it true that for all strings of a given length at least one has its Kolmogorov complexity equal to its length ?

Is there a proof if the answer is in affirmative? (For any alphabet with more than symbol)