A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE

DOI10.1017/S1755020321000125MaRDI QIDQ5099786zbMATH OpenOpenAlexFDO

Authors Tomasz Steifer

Publication date 26 August 2022

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/s1755020321000125

zbMATH Keywords

learning theoryalgorithmic randomnesseffectivization

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS
• On Martin-Löf Convergence of Solomonoff’s Mixture
• Recognizing strong random reals
• Using almost-everywhere theorems from analysis to study randomness
• On Martin-Löf (non-)convergence of Solomonoff's universal mixture

Cites work

• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Algorithmic aspects of Lipschitz functions
• Algorithmic randomness and complexity.
• Algorithmic tests and randomness with respect to a class of measures
• Ergodic theorems for individual random sequences
• Generic computability, Turing degrees, and asymptotic density
• Guessing the next output of a stationary process
• Lectures on summability
• Limiting recursion
• 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
• On a definition of random sequences with respect to conditional probability
• Predictions and algorithmic statistics for infinite sequences
• Recognizing strong random reals
• Schnorr randomness and the Lebesgue differentiation theorem
• The Individual Ergodic Theorem of Information Theory
• The definition of random sequences
• The strong law of large numbers for sequential decisions under uncertainty
• Trial and error predicates and the solution to a problem of Mostowski
• Von Mises' definition of random sequences reconsidered

Cited in

(1)

• A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS

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)