2 problems

Equivalence conjecture. The definition of K-triviality due to Melnikov and Nies for computable Polish spaces is equivalent to being low for $(\mathcal{X},\mu)$-randomness on every…

Extension conjecture. The other known characterizations of computable randomness should extend to arbitrary computable Polish spaces using the techniques described in the source.