Author:
Csima Barbara F.,Downey Rod,Greenberg Noam,Hirschfeldt Denis R.,Miller Joseph S.
Abstract
AbstractA real is called properly n-generic if it is n-generic but not n + 1-generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real.
Publisher
Cambridge University Press (CUP)
Reference12 articles.
1. Nies André , Computability and randomness, Monograph in preparation.
2. Algorithmic Randomness and Complexity
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Large Turing independent sets;Proceedings of the American Mathematical Society;2022-08-18
2. LARGE TURING INDEPENDENT SETS;P AM MATH SOC;2022
3. Algorithmic Randomness and Complexity;Theory and Applications of Computability;2010
4. On initial segment complexity and degrees of randomness;Transactions of the American Mathematical Society;2008-01-10