Author:
Baartse Martijn,Barmpalias George
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference17 articles.
1. Barmpalias, G.: Compactness arguments with effectively closed sets for the study of relative randomness. J. Log. Comput. (2010). doi: 10.1093/logcom/exq036
2. Barmpalias, G.: Elementary differences between the degrees of unsolvability and the degrees of compressibility. Ann. Pure Appl. Log. 161(7), 923–934 (2010)
3. Barmpalias, G.: Relative randomness and cardinality. Notre Dame J. Form. Log. 51(2), 195–205 (2010)
4. Barmpalias, G., Lewis, A.E.M., Stephan, F.: Π 0 1 classes, LR degrees and Turing degrees. Ann. Pure Appl. Log. 156(1), 21–38 (2008)
5. LIPIcs;L. Bienvenu,2011
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献