Ergodic-Type Characterizations of Algorithmic Randomness

DOI10.1007/978-3-642-13962-8_6zbMath1286.03138DBLPconf/cie/BienvenuDMS10OpenAlexW1582256586WikidataQ57349603 ScholiaQ57349603MaRDI QIDQ3576190

Alexander Shen, Adam R. Day, Ilya Mezhirov, Laurent Bienvenu

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_6

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (7)

Randomness, Computation and Mathematics ⋮ On zeros of Martin-Löf random Brownian motion ⋮ A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points ⋮ Randomness and the Ergodic Decomposition ⋮ Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ A Church-Turing thesis for randomness?

This page was built for publication: Ergodic-Type Characterizations of Algorithmic Randomness