Pages that link to "Item:Q418118"
From MaRDI portal
The following pages link to A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118):
Displayed 19 items.
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups (Q722220) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Martin-Löf randomness implies multiple recurrence in effectively closed sets (Q2330508) (← links)
- Nullifying randomness and genericity using symmetric difference (Q2358626) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Randomness and uniform distribution modulo one (Q2672239) (← links)
- Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets (Q2845878) (← links)
- Schnorr randomness and the Lebesgue differentiation theorem (Q2862195) (← links)
- Denjoy, Demuth and density (Q2878781) (← links)
- Effective S-adic Symbolic Dynamical Systems (Q3188236) (← links)
- (Q4643953) (← links)
- Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
- Computability of convergence rates in the ergodic theorem for Martin-Löf random points (Q5043603) (← links)
- UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS (Q5044311) (← links)
- A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE (Q5099786) (← links)
- Computing from projections of random points (Q5114804) (← links)
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS (Q5346702) (← links)
- ON ANALOGUES OF THE CHURCH–TURING THESIS IN ALGORITHMIC RANDOMNESS (Q5737950) (← links)
- Ergodic theorems and converses for PSPACE functions (Q6109066) (← links)