Nullifying randomness and genericity using symmetric difference
From MaRDI portal
Publication:2358626
DOI10.1016/j.apal.2017.03.004zbMath1422.03090OpenAlexW2592830585MaRDI QIDQ2358626
Joseph S. Miller, Rutger Kuyper
Publication date: 15 June 2017
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2017.03.004
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Cites Work
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Lowness for genericity
- Lowness properties and randomness
- Lowness notions, measure and domination
- Truth-table Schnorr randomness and truth-table reducible randomness
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness