Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Barmpalias, G.
2012.
Compactness arguments with effectively closed sets for the study of relative randomness.
Journal of Logic and Computation,
Vol. 22,
Issue. 4,
p.
679.
Diamondstone, David
2012.
Low upper bounds in the LR degrees.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 3,
p.
314.
Barmpalias, George
2013.
Algorithmic Randomness and Measures of Complexity.
The Bulletin of Symbolic Logic,
Vol. 19,
Issue. 3,
p.
318.
Higuchi, Kojiro
Hudelson, W.M. Phillip
Simpson, Stephen G.
and
Yokoyama, Keita
2014.
Propagation of partial randomness.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 2,
p.
742.
Downey, Rod
2014.
Turing's Legacy.
p.
90.
Moser, Philippe
and
Stephan, Frank
2015.
Fundamentals of Computation Theory.
Vol. 9210,
Issue. ,
p.
81.
Beros, Achilles A.
Khan, Mushfeq
and
Kjos-Hanssen, Bjørn
2017.
Computability and Complexity.
Vol. 10010,
Issue. ,
p.
633.
DOWNEY, ROD
and
GREENBERG, NOAM
2018.
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES.
The Bulletin of Symbolic Logic,
Vol. 24,
Issue. 1,
p.
53.
Greenberg, Noam
Miller, Joseph S.
and
Nies, André
2021.
Highness properties close to PA completeness.
Israel Journal of Mathematics,
Vol. 244,
Issue. 1,
p.
419.
Liu, Lu
2021.
A computable analysis of majorizing martingales.
Bulletin of the London Mathematical Society,
Vol. 53,
Issue. 3,
p.
759.
Barmpalias, George
and
Wang, Wei
2022.
Randomness Below Complete Theories of Arithmetic.
SSRN Electronic Journal ,
Barmpalias, George
and
Wang, Wei
2023.
Randomness below complete theories of arithmetic.
Information and Computation,
Vol. 290,
Issue. ,
p.
104983.
Bienvenu, Laurent
Delle Rose, Valentino
and
Merkle, Wolfgang
2023.
Relativized depth.
Theoretical Computer Science,
Vol. 949,
Issue. ,
p.
113694.
Hirschfeldt, Denis R.
Jockusch, Carl G.
and
Schupp, Paul E.
2024.
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics.
Journal of Mathematical Logic,
Vol. 24,
Issue. 02,
Barmpalias, George
and
Zhang, Xiaoyan
2024.
Growth and irreducibility in path-incompressible trees.
Information and Computation,
Vol. 297,
Issue. ,
p.
105136.