Mass problems and measure-theoretic regularity (2009)

by Stephen G. Simpson
Citations:4 - 3 self

Active Bibliography

22 An extension of the recursively enumerable Turing degrees – Stephen G. Simpson - 2006
9 Some fundamental issues concerning degrees of unsolvability – Stephen G. Simpson - 2007
Some fundamental issues concerning degrees – Stephen G. Simpson - 2005
Computability Theory, Algorithmic Randomness and Turing’s Anticipation – Rod Downey
1 Low upper bounds of ideals – Antonín Kučera, Theodore, A. Slaman
24 Mass problems and hyperarithmeticity – Joshua A. Cole, Stephen G. Simpson - 2006
1 On a conjecture of Dobrinen and Simpson concerning almost everywhere domination – Stephen Binns, Bjørn Kjos-hanssen, Manuel Lerman, Reed Solomon - 2005
10 Mass problems and almost everywhere domination – Stephen G. Simpson - 2007
18 Almost everywhere domination and superhighness – Stephen G. Simpson, I Thank Esteban Gomez-riviere
56 Trivial Reals – Rod G. Downey, et al.
1 EXACT PAIRS FOR THE IDEAL OF THE K-TRIVIAL SEQUENCES IN THE TURING DEGREES – George Barmpalias, Rod G. Downey - 2012
Degrees that are low for isomorphism – Johanna N. Y. Franklin, Reed Solomon - 2014
ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY – George Barmpalias
34 Using random sets as oracles – Denis R. Hirschfeldt, Frank Stephan, André Nies
2 Relative Randomness via RK-Reducibility – Alexander Raichev, Wendell Berry - 2006
Topics in Logic and . . . – Stephen G. Simpson - 2005
1 Computational Processes, Observers and Turing Incompleteness – Klaus Sutner
1 STRONG JUMP-TRACEABILITY II: K-TRIVIALITY – Rod Downey, Noam Greenberg - 2010
4 K-TRIVIAL DEGREES AND THE JUMP-TRACEABILITY HIERARCHY – George Barmpalias, Rod Downey, Noam Greenberg