Author:
Hölzl Rupert,Porter Christopher P.
Funder
Alexander von Humboldt Foundation
Ministry of Education Singapore
National Science Foundation
John Templeton Foundation
Reference30 articles.
1. K-trivials are never continuously random;Barmpalias,2011
2. Kolmogorov complexity and Solovay functions;Bienvenu,2009
3. Strong reductions in effective randomness;Bienvenu;Theoret. Comput. Sci.,2012
4. Π10 classes with complex elements;Binns;J. Symbolic Logic,2008
5. A theory of program size formally identical to information theory;Chaitin;J. ACM,1975
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Trees Without Hyperimmune Branches;Revolutions and Revelations in Computability;2022
2. Effective aspects of Bernoulli randomness;Journal of Logic and Computation;2019-10
3. RANK AND RANDOMNESS;The Journal of Symbolic Logic;2019-09-19