Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
From MaRDI portal
Publication:3842376
Recommendations
Cited in
(25)- Algorithmic randomness and Fourier analysis
- A Church-Turing thesis for randomness?
- On stability of probability laws with respect to small violations of algorithmic randomness
- Limit Theorems for the Maximal Random Sums
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Weihrauch-completeness for layerwise computability
- Nonrobustness property of the individual ergodic theorem
- Genericity of weakly computable objects
- Random sequences and pointwise convergence of multiple ergodic averages
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Randomness and the ergodic decomposition
- An approach of randomness of a sample based on its weak ergodic limit
- Computable Measure Theory and Algorithmic Randomness
- Uncomputably noisy ergodic limits
- Ergodic theorems and converses for PSPACE functions
- Ergodic Theorems and Converses for PSPACE Functions
- Computability of convergence rates in the ergodic theorem for Martin-Löf random points
- Realizing semicomputable simplices by computable dynamical systems
- Exponential rates of convergence in the ergodic theorem: a constructive approach
- Computability of the ergodic decomposition
- On effective Birkhoff's ergodic theorem for computable actions of amenable groups
- Oscillation and the mean ergodic theorem for uniformly convex Banach spaces
- Martin-Löf randomness implies multiple recurrence in effectively closed sets
- Memoryless sequences for general losses
This page was built for publication: Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842376)