Low upper bounds of ideals
Low upper bounds of ideals
复制标题
理想上限较低
DOI:
--
复制
发表时间:
2007
期刊:
影响因子:
--
通讯作者:
T. Slaman
中科院分区:
文献类型:
--
作者:
A. Kucera;T. Slaman
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 T-degrees for which there is a low T-upper bound.