- Time-bounded incompressibility of compressible strings and sequences
- Information Processing Letters
- Volume | Issue number
- 109 | 18
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
- Institute for Logic, Language and Computation (ILLC)
For every total recursive time bound It, 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 log n yet t-bounded incompressible below in 1/4 n - logn; 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.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.