4 citations · 7 across the 8 of their papers we have counts for
1 paper · 2 filters
Noam Greenberg, Joseph S. Miller, Andre Nies +1
Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e.\…