LOW UPPER BOUNDS OF IDEALS

by Antonín Kučera , Theodore , A. Slaman
Citations:1 - 0 self

Active Bibliography

2 Interactions of Computability and Randomness – André Nies
4 Turing Incomparability in Scott Sets – Antonín Kučera, Theodore, A. Slaman
5 Eliminating concepts – André Nies - 2008
1 STRONG JUMP-TRACEABILITY II: K-TRIVIALITY – Rod Downey, Noam Greenberg - 2010
21 Relativizing Chaitin’s halting probability – Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
1 Computability and randomness: Five questions – André Nies
4 Beyond strong jump traceability – Keng Meng Ng
4 Mass problems and measure-theoretic regularity – Stephen G. Simpson - 2009
57 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
34 Using random sets as oracles – Denis R. Hirschfeldt, Frank Stephan, André Nies
ALGORITHMIC RANDOMNESS AND MEASURES OF COMPLEXITY – George Barmpalias
CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS – Noam Greenberg, Denis R. Hirschfeldt, André Nies
25 Some Computability-Theoretical Aspects of Reals and Randomness – Rodney G. Downey - 2001
28 Randomness in Computability Theory – Klaus Ambos-spies, Antonín Kucera - 2000
On the number of infinite sequences with . . . – George Barmpalias, et al. - 2011
21 Lowness properties and approximations of the jump – Santiago Figueira, Frank Stephan - 2006
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
3 TURING DEGREES OF REALS OF POSITIVE EFFECTIVE PACKING DIMENSION – Rod Downey, Noam Greenberg