Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Simpson, Stephen G.
1985.
Recursion Theory Week.
Vol. 1141,
Issue. ,
p.
357.
Blum, Manuel
and
Impagliazzo, Russell
1987.
Generic oracles and oracle classes.
p.
118.
Fenner, S.A.
1991.
Notions of resource-bounded category and genericity.
p.
196.
Foster, J.A.
1992.
The generic oracle hypothesis fails.
p.
75.
1992.
Vol. 125,
Issue. ,
p.
603.
Allender, Eric
1992.
Kolmogorov Complexity and Computational Complexity.
p.
4.
Fenner, S.A.
1995.
Resource-bounded Baire category: a stronger approach.
p.
182.
Hemaspaandra, L. A.
and
Zimand, M.
1996.
Strong self-reducibility precludes strong immunity.
Mathematical Systems Theory,
Vol. 29,
Issue. 5,
p.
535.
Gasarch, W.
1998.
Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics.
Vol. 139,
Issue. ,
p.
1041.
Kalantari, I.
1998.
Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory.
Vol. 138,
Issue. ,
p.
515.
Galota, Matthias
Kosub, Sven
and
Vollmer, Heribert
2003.
Generic separations and leaf languages.
Mathematical Logic Quarterly,
Vol. 49,
Issue. 4,
p.
353.
Downey, Rodney G
Griffiths, Evan J
and
Reid, Stephanie
2004.
On Kurtz randomness.
Theoretical Computer Science,
Vol. 321,
Issue. 2-3,
p.
249.
Csima, Barbara F.
and
Kalimullin, Iskander S.
2010.
Degree spectra and immunity properties.
Mathematical Logic Quarterly,
Vol. 56,
Issue. 1,
p.
67.
Cholak, Peter A.
Dzhafarov, Damir D.
and
Hirst, Jeffry L.
2012.
How the World Computes.
Vol. 7318,
Issue. ,
p.
129.
Kučera, Antonín
and
Nies, André
2012.
Computation, Physics and Beyond.
Vol. 7160,
Issue. ,
p.
159.
Andrews, Uri
Gerdes, Peter
and
Miller, Joseph S.
2014.
The degrees of bi-hyperhyperimmune sets.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 3,
p.
803.
Cholak, Peter A.
Dzhafarov, Damir D.
Hirst, Jeffry L.
and
Slaman, Theodore A.
2014.
Generics for computable Mathias forcing.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 9,
p.
1418.
Barmpalias, George
and
Lewis-Pye, Andy
2015.
Turing’s Revolution.
p.
207.
Hirschfeldt, Denis R.
Jockusch, Carl G.
McNicholl, Timothy H.
and
Schupp, Paul E.
2016.
Asymptotic density and the coarse computability bound.
Computability,
Vol. 5,
Issue. 1,
p.
13.
Hirschfeldt, Denis R.
and
Jockusch, Carl G.
2016.
On notions of computability-theoretic reduction between Π21 principles.
Journal of Mathematical Logic,
Vol. 16,
Issue. 01,
p.
1650002.