Luzin's (N) and randomness reflection
@article{Pauly2020LuzinsA, title={Luzin's (N) and randomness reflection}, author={Arno Pauly and L. Westrick and Liang Yu}, journal={arXiv: Logic}, year={2020} }
We show that a computable function $f:\mathbb R\rightarrow\mathbb R$ has Luzin's property (N) if and only if it reflects $\Delta^1_1(\mathcal O)$-randomness, and if and only if it reflects $\mathcal O$-Kurtz randomness, but reflecting Martin-Lof randomness or weak-2-randomness does not suffice. Here a function $f$ is said to reflect a randomness notion $R$ if whenever $f(x)$ is $R$-random, then $x$ is $R$-random as well. If additionally $f$ is known to have bounded variation, then we show $f… CONTINUE READING
Figures from this paper
Figures
References
SHOWING 1-10 OF 29 REFERENCES
On the close interaction between algorithmic randomness and constructive/computable measure theory
- Mathematics, Computer Science
- ArXiv
- 2018
- 1
- PDF
Constructive equivalence relations on computable probability measures
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2009
- 12
- PDF
Algorithmic Randomness and Complexity
- Mathematics, Computer Science
- Theory and Applications of Computability
- 2010
- 763
- PDF
Computability of probability measures and Martin-Löf randomness over metric spaces
- Computer Science, Mathematics
- Inf. Comput.
- 2009
- 112
- PDF