Low upper bounds of ideals
Kucera, Antonin · Slaman, Theodore A.
Original · EN
We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in the T-degrees below 0' for which there is a low T-upper bound.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.