Pages that link to "Item:Q2845878"
From MaRDI portal
The following pages link to Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets (Q2845878):
Displaying 15 items.
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- A Church-Turing thesis for randomness? (Q2117785) (← links)
- Martin-Löf randomness implies multiple recurrence in effectively closed sets (Q2330508) (← links)
- Randomness and uniform distribution modulo one (Q2672239) (← links)
- Schnorr randomness and the Lebesgue differentiation theorem (Q2862195) (← links)
- Randomness, Computation and Mathematics (Q2904405) (← links)
- On zeros of Martin-Löf random Brownian motion (Q2941095) (← 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)
