The sum $2^{KA(x)-KP(x)}$ over all prefixes $x$ of some binary sequence can be infinite

Mikhail Andreev, Akim Kumok

We consider two quantities that measure complexity of binary strings: $KA(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and…