PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Time-bounded incompressibility of compressible strings and sequences
Edgar Daylight, Wouter Koolen and Paul Vitányi
Information Processing Letters Volume 109, Number 18, pp. 1055-1059, 2009.


For every total recursive time bound t, a constant fraction of all compressible (low Kolmogorov complexity) strings is t-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every initial segment of length n is compressible to logn yet t-bounded incompressible below View the MathML source; and there is a countably infinite number of recursive infinite sequences of which every initial segment is similarly t-bounded incompressible. These results and their proofs are related to, but different from, Barzdins's lemma.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
ID Code:6006
Deposited By:Wouter Koolen
Deposited On:08 March 2010