An additivity theorem for plain Kolmogorov complexity
Computational Complexity
2012-02-16 v2
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.
Cite
@article{arxiv.1111.4372,
title = {An additivity theorem for plain Kolmogorov complexity},
author = {Bruno Bauwens and Alexander Shen},
journal= {arXiv preprint arXiv:1111.4372},
year = {2012}
}
Comments
4 pages