I&#x27;m sorry to say this, but your second post also doesn&#x27;t really address the issue and continues to misunderstand the purpose and definitions of Kolgomorov complexity.<p>The fact that for any specific string S you can find a language L such that the Kolgomorov complexity K(L, S) is 0, is not that interesting.<p>1. For any specific L, you can only play this trick (hardcoding a target string) for a finite number of strings. That means for essentially all strings (all but a small finite number) the trick is irrelevant.<p>2. There is no free lunch: The trick you use to bring down the Kolgomorov complexity K(L, S) down to 0 increases the complexity of L. This can be taken into account, see &quot;conditional Kolgomorov complexity&quot;.<p>The book &quot;An Introduction to Kolmogorov Complexity and Its Applications&quot; by Li and Vitányi explains this, and much more in great detail, and is highly recommended.