| Authors |
|
| Publication date |
2009
|
| Journal |
Information Processing Letters
|
| Volume | Issue number |
109 | 18
|
| Pages (from-to) |
1055-1059
|
| Organisations |
-
Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
|
| Abstract |
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.
|
| Document type |
Article
|
| Published at |
https://doi.org/10.1016/j.ipl.2009.06.013
|
|
Permalink to this page
|