Algorithmic Information Theory
We investigate interesting variations of the notion of Kolmogorov complexity.
-
Time-bounded incompressibility of compressible strings and sequences
Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi
Information Processing Letters (IPL), 109(18):1055 – 1059, August 2009.
-
Kolmogorov complexity theory over the reals
Martin Ziegler, Wouter M. Koolen
Electronic Notes in Theoretical Computer Science (ENTCS), 221:153–169, December 2008.