You&#x27;re confusing the statement<p>&quot;The Kolgomorov complexity of all strings is zero&quot;<p>with<p>&quot;For every string there exists a definition of Kolmogorov complexity in which that string has complexity 0&quot;<p>The first (which you claim as a Theorem) presumes an already fixed definition of complexity, and is therefore false,
while the second is what you proof, and which is not interesting.<p>Here&#x27;s how I would fix the definition of Kolmogorov Complexity:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Binary_lambda_calculus" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Binary_lambda_calculus</a>