2 citations · 2 across the 2 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.IT2008★ 2 cited
Algorithmic information theory
Peter D. Grunwald, Paul M. B. Vitanyi
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'…
cs.CC2008
On Time-Bounded Incompressibility of Compressible Strings and Sequences
E. G. Daylight, W. M. Koolen, P. M. B. Vitanyi
For every total recursive time bound , a constant fraction of all compressible (low Kolmogorov complexity) strings is -bounded incompressible (high time-bounded Kolmogorov co…