Chain rule for Kolmogorov complexity: Difference between revisions

Content deleted Content added
No edit summary
Proof: use comm syntax (but a lot is still to do in this article)
Line 35:
For the ≥ direction, it suffices to show that for all k,l such that k+l = K(x,y) we have that either
 
''K(x|k,l) ≤ k + O(1)''

or

''K(y|x,k,l) ≤ l + O(1)''.
 
Consider the list ''(a<sub>1</sub>,b<sub>1</sub>), (a<sub>2</sub>,b<sub>2</sub>), ..., (a<sub>e</sub>,b<sub>e</sub>)'' of all pairs ''(a,b)'' produced by programs of length exactly ''K(x,y)'' [hence K(a,b) ≤ K(x,y)]. Note that this list