Randomness and uniform distribution modulo one

DOI10.1016/j.ic.2021.104857OpenAlexW4206187014MaRDI QIDQ2672239

Verónica Becher, Serge Grigorieff

Publication date: 8 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.10202

zbMATH Keywords

Martin-Löf randomnessuniform distribution modulo 1random real numberKoksma general metric theorem

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• Random numbers as probabilities of machine behavior
• Randomness on computable probability spaces -- a dynamical point of view
• Sequences, discrepancies and applications
• Computing halting probabilities from other halting probabilities
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
• Algorithmic Randomness and Complexity
• Randomness and halting probabilities
• From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II
• A Theory of Program Size Formally Identical to Information Theory
• Uniform distribution and algorithmic randomness
• Algorithmic Randomness
• Schnorr randomness
• The definition of random sequences
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• Probability-1

This page was built for publication: Randomness and uniform distribution modulo one