Counting the changes of random _2⁰ sets

DOI10.1093/LOGCOM/EXS083zbMATH Open1338.03081OpenAlexW1947779298MaRDI QIDQ3465047FDOQ3465047

Authors: Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies 

Publication date: 28 January 2016

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs083

Recommendations

• Counting the changes of random \({\Delta}^0_2\) sets
• Calibrating the complexity of \(\Delta_2^0\) sets via their changes
• JSL volume 79 issue 2 Cover and Front matter
• Relative randomness and cardinality
• Computably enumerable sets below random sets

zbMATH Keywords

lownessbalanced randomnessMartin-Löf randomness\(\omega\)-c.e. jump domination\(\omega\)-c.e. tracingcomputable approximation

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Cited In (7)

• Some Questions in Computable Mathematics
• Computing from projections of random points
• Randomness notions and reverse mathematics
• Counting the changes of random \({\Delta}^0_2\) sets
• Calibrating the complexity of \(\Delta_2^0\) sets via their changes
• Using almost-everywhere theorems from analysis to study randomness
• Continuous higher randomness

This page was built for publication: Counting the changes of random \(\Delta_2^0\) sets

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