4 search results - page 1 / 1 » Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas
STACS
2005
Springer
13 years 10 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
COCO
1994
Springer
13 years 8 months ago
1994
Springer
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...