An additivity theorem for plain Kolmogorov complexity

Details An additivity theorem for plain Kolmogorov complexity An additivity theorem for plain Kolmogorov complexity

2011-11-18

arxiv.org/abs/1111.4372v2

Computer Science

Computational Complexity

4 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An additivity theorem for plain Kolmogorov complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An additivity theorem for plain Kolmogorov complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An additivity theorem for plain Kolmogorov complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-549554