Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Figueira, Santiago
Stephan, Frank
and
Wu, Guohua
2006.
Randomness and universal machines.
Journal of Complexity,
Vol. 22,
Issue. 6,
p.
738.
Stephan, Frank
and
Yu, Liang
2006.
Theory and Applications of Models of Computation.
Vol. 3959,
Issue. ,
p.
756.
Merkle, Wolfgang
and
Stephan, Frank
2007.
On C-Degrees, H-Degrees and T-Degrees.
p.
60.
Mayordomo, Elvira
2008.
New Computational Paradigms.
p.
259.
Franklin, Johanna N. Y.
2008.
Hyperimmune-free degrees and Schnorr triviality.
Journal of Symbolic Logic,
Vol. 73,
Issue. 3,
p.
999.
Barmpalias, George
Lewis, Andrew E.M.
and
Stephan, Frank
2008.
Π10 classes, LR degrees and Turing degrees.
Annals of Pure and Applied Logic,
Vol. 156,
Issue. 1,
p.
21.
JÜRGENSEN, H.
2008.
COMPLEXITY, INFORMATION, ENERGY.
International Journal of Foundations of Computer Science,
Vol. 19,
Issue. 04,
p.
781.
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.
Zimand, Marius
2008.
Computer Science – Theory and Applications.
Vol. 5010,
Issue. ,
p.
326.
Brattka, Vasco
Hertling, Peter
and
Weihrauch, Klaus
2008.
New Computational Paradigms.
p.
425.
Downey, Rod
and
Greenberg, Noam
2008.
Turing degrees of reals of positive effective packing dimension.
Information Processing Letters,
Vol. 108,
Issue. 5,
p.
298.
Barmpalias, George
Downey, Rod
and
Greenberg, Noam
2009.
𝐾-trivial degrees and the jump-traceability hierarchy.
Proceedings of the American Mathematical Society,
Vol. 137,
Issue. 6,
p.
2099.
Kučera, Antonín
and
Slaman, Theodore A.
2009.
Low upper bounds of ideals.
The Journal of Symbolic Logic,
Vol. 74,
Issue. 2,
p.
517.
Miller , Joseph S.
2009.
The K-Degrees, Low for K Degrees,and Weakly Low for K Sets.
Notre Dame Journal of Formal Logic,
Vol. 50,
Issue. 4,
Kastermans, Bart
and
Lempp, Steffen
2010.
Comparing notions of randomness.
Theoretical Computer Science,
Vol. 411,
Issue. 3,
p.
602.
Suppes, Patrick
2010.
The nature of probability.
Philosophical Studies,
Vol. 147,
Issue. 1,
p.
89.
Greenberg, Noam
and
Nies, André
2011.
Benign cost functions and lowness properties.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 1,
p.
289.
Barmpalias, George
Downey, Rod
and
Ng, Keng Meng
2011.
Jump inversions inside effectively closed sets and applications to randomness.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 2,
p.
491.
Barmpalias, George
and
Nies, André
2011.
Upper bounds on ideals in the computably enumerable Turing degrees.
Annals of Pure and Applied Logic,
Vol. 162,
Issue. 6,
p.
465.
Fortnow, Lance
Hitchcock, John M.
Pavan, A.
Vinodchandran, N.V.
and
Wang, Fengming
2011.
Extracting Kolmogorov complexity with applications to dimension zero-one laws.
Information and Computation,
Vol. 209,
Issue. 4,
p.
627.