Computing K-Trivial Sets by Incomplete Random Sets

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'.