A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
From MaRDI portal
Publication:5099786
DOI10.1017/S1755020321000125OpenAlexW3138044606MaRDI QIDQ5099786FDOQ5099786
Publication date: 26 August 2022
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1755020321000125
Cites Work
- Title not available (Why is that?)
- Algorithmic Randomness and Complexity
- A formal theory of inductive inference. Part I
- The definition of random sequences
- A formal theory of inductive inference. Part II
- The Individual Ergodic Theorem of Information Theory
- Ergodic theorems for individual random sequences
- Algorithmic tests and randomness with respect to a class of measures
- Schnorr randomness and the Lebesgue differentiation theorem
- On a definition of random sequences with respect to conditional probability
- Von Mises' definition of random sequences reconsidered
- Trial and error predicates and the solution to a problem of Mostowski
- Generic computability, Turing degrees, and asymptotic density
- Limiting recursion
- Guessing the next output of a stationary process
- Predictions and algorithmic statistics for infinite sequences
- Lectures on summability
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- The strong law of large numbers for sequential decisions under uncertainty
- Algorithmic Aspects of Lipschitz Functions
- Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
- On Martin-Löf (non-)convergence of Solomonoff's universal mixture
- RECOGNIZING STRONG RANDOM REALS
This page was built for publication: A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5099786)
