An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Mathematical metaphysics of randomness
Theoretical Computer Science - Special issue Kolmogorov complexity
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Dimension in Complexity Classes
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
The dimensions of individual strings and sequences
Information and Computation
Kolmogorov-Loveland stochasticity for finite strings
Information Processing Letters
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On the sysRatio and its critical point
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Merkle et al. [11] that all Kolmogorov-Loveland stochastic infinite binary sequences have constructive Hausdorff dimension 1. In this paper, we go even further, showing that from an infinite sequence of dimension less than H(1/2+ δ) (H being the Shannon entropy function) one can extract by a selection rule a biased subsequence with bias at least d. We also prove an analogous result for finite strings.