暂无分享,去创建一个
We prove that there exist finite strings with very low Kolmogorov complexity that have very high time-bounded Kolmogorov complexity. Such strings are compressible but time-bounded incompressible. For every total recursive time bound t, a constant fraction of all compressible strings is t-bounded incompressible.
[1] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[2] Donald W. Loveland,et al. A Variant of the Kolmogorov Concept of Complexity , 1969, Information and Control.