2 citations · 7 across the 12 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.LO2011★ 1 cited
Inherent enumerability of strong jump-traceability
David Diamondstone, Noam Greenberg, Daniel Turetsky
We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable…
math.LO2011
Strong jump traceability and Demuth randomness
Noam Greenberg, Daniel Turetsky
We solve the covering problem for Demuth randomness, showing that a computably enumerable set is computable from a Demuth random set if and only if it is strongly jump-traceable. W…