Abstract
We show that a Martin-Lof random set for which the effective version of the Lebesgue density theorem fails computes every K-trivial set. Combined with a recent result by Day and Miller, this gives a positive solution to the ML-covering problem (Question 4.6 in Randomness and computability: Open questions.
Bull. Symbolic Logic, 12(3):390-410, 2006).
On the other hand, we settle stronger variants of the covering problem in the negative. We show that any witness for the solution of the covering problem, namely an incomplete random set which computes all K-trivial sets, must be very close to being Turing complete.
For example, such a random set must be LR-hard. Similarly, not every K-trivial set is computed by the two halves of a random set.
The work passes through a notion of randomness which characterises computing K-trivial sets by random sets. This gives a \smart" K-trivial set, all randoms from whom this set is computed have to compute all K-trivial sets.