Let CR, SR, KLR, and MLR be the classes of computably random, Schnorr random, Kolmogorov-Loveland random, and Martin-Löf random reals, respectively.
For basic definitions from algorithmic randoness, the reader may consult two recent monographs [1]}, [2]}.
Let \(\le _s\)  denote the uniform (strong) reducibility of mass problems known as Medvedev reducibility, and let \(\le _w\)  denote the non-uniform (weak) version known as Muchnik reducibility.
It was shown by Nies, Stephan and Terwijn [3]} that \(\mathrm {CR}\le _w\mathrm {SR}\) .
Miyabe [4]} obtains an interesting counterpoint by showing as his main theorem that \(\mathrm {CR}\lnot \le _s\mathrm {SR}\) .
