TURING DEGREES OF REALS OF POSITIVE EFFECTIVE PACKING DIMENSION

by Rod Downey , Noam Greenberg
Citations:3 - 2 self

Documents Related by Co-Citation

59 Calibrating randomness – Rod Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan, A. Terwijn
158 Algorithmic Randomness and Complexity – Rod Downey, Denis Hirshfeldt - 2010
24 Array Nonrecursive Degrees and Genericity – Rod Downey, Carl G. Jockusch, Michael Stob - 1996
8 Totally ω-computably enumerable degrees and bounding critical triples, preprint – Rod Downey, Noam Greenberg, Rebecca Weber
30 Array nonrecursive sets and multiple permitting arguments – R Downey, C Jockusch, M Stob - 1990
7 On Π 0 1 classes and their ranked points, Notre Dame – R Downey - 1991
18 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
3 WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY ω-C.E. DEGREES – George Barmpalias, Rod Downey, Noam Greenberg
7 Martin-Löf random sets and PA-complete sets – F Stephan - 2006
4 A Hierarchy of computably enumerable degrees, unifying classes and natural definability – R Downey, N Greenberg
2 A hierarchy of sets, Part 1 – Y Ershov - 1968
2 A hierarchy of sets, Part 2 – Y Ershov - 1968
94 Computability and Randomness – André Nies
22 Low for random reals and positive-measure domination – Bjørn Kjos-hanssen, Communicated Julia Knight - 2005
24 Mass problems and hyperarithmeticity – Joshua A. Cole, Stephen G. Simpson - 2006
1 Bounded Randomness ⋆ – Paul Brodhead, Rod Downey, Keng Meng Ng
1 Lowness for Demuth randomness, in preparation – L Bienvenu, R Downey, N Greenberg, A Nies, D Turetsky
1 Constructive dimension and Turing degrees. Theory Comput – Laurent Bienvenu, David Doty, Frank Stephan
11 Computability and fractal dimension. Doctoral dissertation, Universität – Jan Reimann - 2004