Lowness for bounded randomness.
Ng, Keng Meng
Date of Issue2012
School of Physical and Mathematical Sciences
In , Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out to be intertwined with the lowness notions for these two concepts. In fact, in one case, we get a new and likely very useful characterization of K-triviality.
Theoretical computer science
© 2012 Elsevier B.V.