The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
From MaRDI portal
Publication:4650290
DOI10.2178/jsl/1067620192zbMath1065.03024OpenAlexW2140235007MaRDI QIDQ4650290
Publication date: 9 February 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1067620192
Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)
Related Items (12)
When does randomness come from randomness? ⋮ Kolmogorov-Loveland stochasticity for finite strings ⋮ Polynomial clone reducibility ⋮ Some Questions in Computable Mathematics ⋮ How much randomness is needed for statistics? ⋮ The complexity of stochastic sequences ⋮ Uniform distribution and algorithmic randomness ⋮ Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ Computable randomness and betting for computable probability spaces ⋮ Constructive equivalence relations on computable probability measures ⋮ ON DISCRETE STOCHASTIC PROCESSES WITH DISJUNCTIVE OUTCOMES ⋮ Kolmogorov-Loveland randomness and stochasticity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- Mathematical metaphysics of randomness
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Can an individual sequence of zeros and ones be random?
- Algorithms and Randomness
- Minimal-program complexity of pseudo-recursive and pseudo-random sequences
- Resource-bounded balanced genericity, stochasticity and weak randomness
- The Kleene Hierarchy Classification of Recursively Random Sequences
- The definition of random sequences
- On the concept of a random sequence
This page was built for publication: The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
