Structural complexity 2
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
Feasible reductions to Kolmogorov-Loveland stochastic sequences
Theoretical Computer Science
| Hi-index | 0.00 |
It is shown that the class of Kolmogorov-Loveland stochastic sequences is not closed under selecting subsequences by monotonic computable selection rules. This result gives a strong negative answer to the question whether the Kolmogorov-Loveland stochastic sequences are closed under selecting subsequences by Kolmogorov-Loveland selection rules, i.e., by not necessarily monotonic, partially computable selection rules. The following previously known results are obtained as corollaries. The Mises-Wald-Church stochastic sequences are not closed under computable permutations, hence in particular they form a strict superclass of the class of Kolmogorov-Loveland stochastic sequences. The Kolmogorov-Loveland selection rules are not closed under composition.