55 citations · 133 across the 13 of their papers we have counts for
Showing 2012 · math.LOShow all
2 papers · 2 filters
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…
math.LO2012★ 21 cited
Connected Choice and the Brouwer Fixed Point Theorem
Vasco Brattka, Stéphane Le Roux, Joseph S. Miller +1
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed…