关于可压缩字符串和序列的时间有界不可压缩性
On Time-Bounded Incompressibility of Compressible Strings and Sequences
摘要：
对于每个总递归时间界$t$，所有可压缩（低Kolmogorov复杂度）字符串是$t$ -有界不可压缩的（高时间有界Kolmogorov复杂度）;存在无数个无限序列，其中长度为$n$的每个初始段可压缩为$\log n$，但$t$ -有界不可压缩低于${1/4}n - \log n$ ;并且存在可数无穷多个递归无穷序列，它们的每一个初始段都是相似的$t$ -有界不可压缩的.这些结果与Barzdins引理有关，但又不同.
英文摘要：
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 $\log n$ yet $t$-bounded incompressible below ${1/4}n - \log n$; and there are countable infinitely many recursive infinite sequence of which every initial segment is similarly $t$-bounded incompressible. These results are related to, but different from, Barzdins's lemma.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
