4 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Laurent Bienvenu, Adam R. Day, Noam Greenberg +4
Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute 0'.