Counting the changes of random Δ20 sets

DOI10.1093/logcom/exs083zbMath1338.03081OpenAlexW1947779298MaRDI QIDQ3465047

Joseph S. Miller, Keng Meng Ng, Denis R. Hirschfeldt, Santiago Figueira, 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (5)

USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ Computing from projections of random points ⋮ Some Questions in Computable Mathematics ⋮ Continuous higher randomness

This page was built for publication: Counting the changes of random Δ20 sets