3 problems

Assume that $\mathbb{X}$ and $\mathbb{Y}$ are computable metric spaces, that $\{\mu_a\}_{a\in\mathbb{N}^{\mathbb{N}}}$ is a uniformly computable family of probability measures on…

A real $x\in[0,1]^n$ is computably random if it avoids every effectively presented sequence of open sets forming a Martin-Löf test with the stronger computable-martingale randomnes…

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