Density, forcing, and the covering problem
arXiv:1304.2789
Abstract
We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X does not compute 0' and X computes every K-trivial set.