An additivity theorem for plain Kolmogorov complexity
classification
💻 cs.CC
keywords
plaincomplexityadditivitycomplexitiescomponentsconditionalexpressesformula
read the original abstract
We prove the formula C(a,b) = K(a|C(a,b)) + C(b|a,C(a,b)) + O(1) that expresses the plain complexity of a pair in terms of prefix and plain conditional complexities of its components.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.