1 citations · 1 across the 1 of their papers we have counts for
1 paper
Antonin Kucera, Theodore A. Slaman
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 ca…