Density, forcing, and the covering problem

TL;DR

This paper introduces a new forcing technique to demonstrate the existence of a Martin-Löf random set with specific computational properties, notably not computing 0' but computing all K-trivial sets.

Contribution

It presents a novel forcing method that constructs a Martin-Löf random set with unique computational capabilities, expanding understanding of randomness and triviality in computability theory.

Findings

Existence of a Martin-Löf random set not computing 0'

Such a set computes every K-trivial set

New forcing technique developed

Abstract

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-L\"of random set X such that X does not compute 0' and X computes every K-trivial set.