The complexity of recursive splittings of random sets

DOI10.3233/COM-14023MaRDI QIDQ4979763zbMATH OpenOpenAlexFDO

Authors Keng Meng Ng, André Nies, Frank Stephan

Publication date 19 June 2014

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-14023

zbMATH Keywords

algorithmic randomnesscomputabilitysplitting

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Recommendations

• Computing from projections of random points
• Randomness, relativization and Turing degrees
• scientific article; zbMATH DE number 1929969
• Computational randomness and lowness
• Lowness for the class of random sets

Cited in

(1)

• On random oracle separations

This page was built for publication: The complexity of recursive splittings of random sets

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