BibTeX
@TECHREPORT{Kučera_lowupper,
author = {Antonín Kučera and Theodore and A. Slaman},
title = {Low upper bounds of ideals},
institution = {},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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 ∆0 2 T-degrees for which there is a low T-upper bound. 1.
