Lowness for the class of Schnorr random reals
Bj{\o}rn Kjos-Hanssen, Andr\'e Nies, and Frank Stephan

TL;DR
This paper proves that if a real is low for Schnorr randomness, then it is also low for Schnorr tests, confirming a conjecture in the field of algorithmic randomness.
Contribution
It establishes that lowness for Schnorr randomness implies lowness for Schnorr tests, resolving an open question.
Findings
Confirmed that lowness for Schnorr randomness implies lowness for Schnorr tests.
Answered an open question posed by Ambos-Spies and Kucera.
Strengthened understanding of the relationship between different notions of lowness in algorithmic randomness.
Abstract
We answer a question of Ambos-Spies and Ku\v{c}era in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr tests.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
