Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Terwijn, Sebastiaan A.
2001.
Reuniting the Antipodes — Constructive and Nonstandard Views of the Continuum.
p.
271.
Downey, Rod G.
Hirschfeldt, Denis R.
Nies, André
and
Stephan, Frank
2002.
Trivial Reals.
Electronic Notes in Theoretical Computer Science,
Vol. 66,
Issue. 1,
p.
36.
Calude, Cristian S.
2002.
Information and Randomness.
p.
237.
Downey, Rodney G
Griffiths, Evan J
and
Reid, Stephanie
2004.
On Kurtz randomness.
Theoretical Computer Science,
Vol. 321,
Issue. 2-3,
p.
249.
Downey, Rod
2004.
Mathematical Foundations of Computer Science 2004.
Vol. 3153,
Issue. ,
p.
42.
Simpson, Stephen G.
2005.
Mass Problems and Randomness.
Bulletin of Symbolic Logic,
Vol. 11,
Issue. 1,
p.
1.
Nies, André
2005.
Lowness properties and randomness.
Advances in Mathematics,
Vol. 197,
Issue. 1,
p.
274.
Kjos-Hanssen, Bjorn
Nies, André
and
Stephan, Frank
2005.
Lowness for the Class of Schnorr Random Reals.
SIAM Journal on Computing,
Vol. 35,
Issue. 3,
p.
647.
Barmpalias, George
2006.
Random non-cupping revisited.
Journal of Complexity,
Vol. 22,
Issue. 6,
p.
850.
Downey, Rod
Hirschfeldt, Denis R.
Nies, André
and
Terwijn, Sebastiaan A.
2006.
Calibrating Randomness.
Bulletin of Symbolic Logic,
Vol. 12,
Issue. 3,
p.
411.
Barmpalias, George
Lewis, Andrew E. M.
and
Soskova, Mariya
2007.
Theory and Applications of Models of Computation.
Vol. 4484,
Issue. ,
p.
89.
Simpson, Stephen G.
2007.
Mass problems and almost everywhere domination.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
483.
Merkle, Wolfgang
and
Stephan, Frank
2007.
On C-Degrees, H-Degrees and T-Degrees.
p.
60.
Barmpalias, George
Cenzer, Douglas
Remmel, Jeffrey B.
and
Weber, Rebecca
2007.
Computation and Logic in the Real World.
Vol. 4497,
Issue. ,
p.
135.
Simpson, Stephen G.
2007.
Almost everywhere domination and superhighness.
Mathematical Logic Quarterly,
Vol. 53,
Issue. 4-5,
p.
462.
Cholak, Peter
Downey, Rod
and
Greenberg, Noam
2008.
Strong jump-traceability I: The computably enumerable case.
Advances in Mathematics,
Vol. 217,
Issue. 5,
p.
2045.
Urquhart, Alasdair
2009.
2009 North American Annual Meeting of the Association for Symbolic Logic.
The Bulletin of Symbolic Logic,
Vol. 15,
Issue. 4,
p.
441.
Barmpalias, G.
Cenzer, D.
Remmel, J. B.
and
Weber, R.
2009.
K-Triviality of Closed Sets and Continuous Functions.
Journal of Logic and Computation,
Vol. 19,
Issue. 1,
p.
3.
2010.
2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09.
The Bulletin of Symbolic Logic,
Vol. 16,
Issue. 1,
p.
90.
Barmpalias, George
2010.
Relative Randomness and Cardinality.
Notre Dame Journal of Formal Logic,
Vol. 51,
Issue. 2,