4 problems

Schnorr $K$-test conjecture. The appropriate test for Schnorr $K$-randomness is a lower semicomputable function $t$ such that the map

Schnorr-neutrality degree conjecture. A result analogous to the theorem that each weakly neutral measure has no least Turing degree computing it should hold for Schnorr randomness,…

Schnorr-Fuchs equivalence conjecture. For a large class of measures, including Bernoulli measures, Schnorr-Fuchs randomness agrees with the paper's definition of Schnorr randomness…

Uniform-computability conjecture. The converse to the implication that uniform computation preserves uniform Schnorr randomness should hold: whenever, for all appropriate measures…