55 citations · 133 across the 13 of their papers we have counts for
3 papers · 2 filters
Dimension 1 sequences are close to randoms
Noam Greenberg, Joe Miller, Alexander Shen +1
We show that a sequence has effective Hausdorff dimension 1 if and only if it is coarsely similar to a Martin-Löf random sequence. More generally, a sequence has effective dimensio…
Martin-Löf reducibility and cost functions
Noam Greenberg, Joseph S. Miller, Andre Nies +1
Martin-Löf (ML)-reducibility compares -trivial sets by examining the Martin-Löf random sequences that compute them. We show that every -trivial set is computable from a c.e.\…
Computing from projections of random points: a dense hierarchy of subideals of the -trivial degrees
Noam Greenberg, Joseph S. Miller, Andre Nies
We study the sets that are computable from both halves of some (Martin-Löf) random sequence, which we call \emph{-bases}. We show that the collection of such sets forms an ide…