46 citations · 53 across the 4 of their papers we have counts for
3 papers
cs.LO2014★ 7 cited
Random strings and tt-degrees of Turing complete C.E. sets
Mingzhong Cai, Rodney G Downey, Rachel Epstein +2
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-fr…
math.LO2014★ 46 cited
Lowness notions, measure and domination
Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon
We show that positive measure domination implies uniform almost everywhere domination and that this proof translates into a proof in the subsystem WWKL (but not in RCA) of…
math.LO2012
Cupping with random sets
Adam R. Day, Joseph S. Miller
We prove that a set is K-trivial if and only if it is not weakly ML-cuppable. Further, we show that a set below zero jump is K-trivial if and only if it is not ML-cuppable. These r…