Showing cs.ITShow all
2 papers · 1 filter
cs.IT2014
The sum over all prefixes of some binary sequence can be infinite
Mikhail Andreev, Akim Kumok
We consider two quantities that measure complexity of binary strings: is defined as the minus logarithm of continuous a priori probability on the binary tree, and…
cs.IT2010
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One
Mikhail Andreev, Ilya Razenshteyn, Alexander Shen
C.Calude, A.Nies, L.Staiger, and F.Stephan posed the following question about the relation between plain and prefix Kolmogorov complexities (see their paper in DLT 2008 conference…