Uniform relativization conjecture for computable randomness under layerwise maps
Assume that and are computable metric spaces, that is a uniformly computable family of probability measures on , and that is a family of layerwise maps , with Schnorr layerwise computable uniformly in . For , say that is -computably random uniformly relativized to when it passes every uniformly relativized computable randomness test as defined in the setup. Uniform relativization conjecture. If is -computably random uniformly relativized to , then there exists which is -computably random uniformly relativized to such that . This is presented as the full generalization of the non-relativized result to uniform relativization; the surrounding discussion explains why uniform relativization is the relevant strengthening for computable randomness. The supplied text gives no resolution, so the conjecture remains open.
References
Primary source
Jason Rute, “When does randomness come from randomness?”, arXiv:1508.05082 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.