It is shown 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.
