A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Symmetry of information states that C(x) + C(y|x) = C(x, y) + O(log C(x)). In  an online variant of Kolmogorov complexity is introduced and we show that a similar relation does not hold. Let the even (online Kolmogorov) complexity of an n-bitstring x 1 x 2 . . . x n be the length of a shortest program that computes x 2 on input x 1 , computes x 4 on input x 1 x 2 x 3 , etc; and similar for odd complexity. We show that for all n there exists an n-bit x such that both odd and even complexityfatcat:lbfmf44qjvc5hdtu6wurrudf74