55 citations · 164 across the 24 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.LO2011★ 4 cited
Characterizing the strongly jump-traceable sets via randomness
Noam Greenberg, Denis Hirschfeldt, Andre Nies
We show that if a set is computable from every superlow 1-random set, then is strongly jump-traceable. This theorem shows that the computably enumerable (c.e.) strongly jum…
math.LO2011★ 55 cited
Randomness and Differentiability
Vasco Brattka, Joseph S. Miller, André Nies
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably r…