Nullifying randomness and genericity using symmetric difference

DOI10.1016/J.APAL.2017.03.004MaRDI QIDQ2358626zbMATH OpenOpenAlexFDO

Authors Rutger Kuyper, Joseph S. Miller

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

zbMATH Keywords

algorithmic randomness\(K\)-trivial sets

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)

Recommendations

• Lowness properties and randomness
• Interactions of computability and randomness
• Computuing \(K\)-trivial sets by incomplete random sets
• Density, forcing, and the covering problem
• Lowness for the class of random sets

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 notions, measure and domination
• Lowness properties and randomness
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Truth-table Schnorr randomness and truth-table reducible randomness
• Van Lambalgen's theorem for uniformly relative Schnorr and computable randomness

Cited in

(1)

• Martin-Löf reducibility and cost functions

This page was built for publication: Nullifying randomness and genericity using symmetric difference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358626)