Year |
Citation |
Score |
2020 |
Greenberg N, Miller JS, Nies A. Computing from projections of random points Journal of Mathematical Logic. 20: 1950014. DOI: 10.1142/S0219061319500144 |
0.375 |
|
2018 |
Downey R, Greenberg N. A hierarchy of computably enumerable degrees The Bulletin of Symbolic Logic. 24: 53-89. DOI: 10.1017/Bsl.2017.41 |
0.35 |
|
2017 |
Bienvenu L, Greenberg N, Monin B. Continuous higher randomness Journal of Mathematical Logic. 17: 1750004. DOI: 10.1142/S0219061317500040 |
0.409 |
|
2017 |
GREENBERG N, MONIN B. HIGHER RANDOMNESS AND GENERICITY Forum of Mathematics, Sigma. 5. DOI: 10.1017/Fms.2017.27 |
0.314 |
|
2016 |
Bienvenu L, Greenberg N, Kučera A, Nies A, Turetsky D. Coherent randomness tests and computing the K-trivial sets Journal of the European Mathematical Society. 18: 773-812. DOI: 10.4171/Jems/602 |
0.408 |
|
2016 |
Cai M, Greenberg N, McInerney M. DNR and incomparable Turing degrees Forum of Mathematics, Sigma. 4. DOI: 10.1017/Fms.2016.3 |
0.308 |
|
2016 |
Downey R, Greenberg N, Miller JS. Generic muchnik reducibility and presentations of fields Israel Journal of Mathematics. 216: 371-387. DOI: 10.1007/S11856-016-1413-7 |
0.399 |
|
2016 |
Greenberg N. Editorial: Special Issue on Computability, Complexity and Randomness Theory of Computing Systems. 58: 381-382. DOI: 10.1007/S00224-015-9648-Y |
0.378 |
|
2015 |
Greenberg N, Kach AM, Lempp S, Turetsky DD. Computability and uncountable linear orders II: Degree spectra Journal of Symbolic Logic. 80: 145-178. DOI: 10.1017/Jsl.2014.69 |
0.375 |
|
2015 |
Greenberg N, Kach AM, Lempp S, Turetsky DD. Computability and uncountable linear orders I: Computable categoricity Journal of Symbolic Logic. 80: 116-144. DOI: 10.1017/Jsl.2014.68 |
0.362 |
|
2014 |
Greenberg N, Turetsky DD. Strong jump-traceability and Demuth randomness Proceedings of the London Mathematical Society. 108: 738-779. DOI: 10.1112/Plms/Pdt040 |
0.415 |
|
2014 |
Diamondstone D, Greenberg N, Turetsky DD. Inherent enumerability of strong jump-traceability Transactions of the American Mathematical Society. 367: 1771-1796. DOI: 10.1090/S0002-9947-2014-06089-3 |
0.412 |
|
2014 |
Bienvenu L, Downey R, Greenberg N, Nies A, Turetsky D. Characterizing lowness for demuth randomness Journal of Symbolic Logic. 79: 526-560. DOI: 10.1017/Jsl.2013.21 |
0.359 |
|
2014 |
Bienvenu L, Day AR, Greenberg N, Ku?era A, Miller JS, Nies A, Turetsky D. Computing k-trivial sets by incomplete random sets Bulletin of Symbolic Logic. 20: 80-90. DOI: 10.1017/Bsl.2013.3 |
0.394 |
|
2013 |
Franklin JNY, Greenberg N, Stephan F, Wu G. Anti-Complex Sets and Reducibilities with Tiny Use Journal of Symbolic Logic. 78: 1307-1327. DOI: 10.2178/Jsl.7804170 |
0.313 |
|
2013 |
Greenberg N, Montalbán A, Slaman TA. Relative to any non-hyperarithmetic set Journal of Mathematical Logic. 13. DOI: 10.1142/S0219061312500079 |
0.37 |
|
2013 |
Bienvenu L, Greenberg N, Kučera A, Miller JS, Nies A, Turetsky D. Joining non-low C.E. sets with diagonally non-computable functions Journal of Logic and Computation. 23: 1183-1194. DOI: 10.1093/Logcom/Ext039 |
0.406 |
|
2013 |
Downey R, Greenberg N, Lewis A, Montalbán A. Extensions of embeddings below computably enumerable degrees Transactions of the American Mathematical Society. 365: 2977-3018. DOI: 10.1090/S0002-9947-2012-05660-1 |
0.412 |
|
2013 |
Downey R, Greenberg N. Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability Advances in Mathematics. 237: 252-285. DOI: 10.1016/J.Aim.2012.12.018 |
0.387 |
|
2012 |
Greenberg N, Hirschfeldt DR, Nies A. Characterizing the strongly jump-traceable sets via randomness Advances in Mathematics. 231: 2252-2293. DOI: 10.1016/J.Aim.2012.06.005 |
0.419 |
|
2012 |
Downey R, Greenberg N. Strong jump-traceability II: K-triviality Israel Journal of Mathematics. 191: 647-665. DOI: 10.1007/S11856-011-0217-Z |
0.341 |
|
2011 |
Greenberg N. A random set which only computes strongly jump-traceable C.E. Sets Journal of Symbolic Logic. 76: 700-718. DOI: 10.2178/Jsl/1305810771 |
0.428 |
|
2011 |
Greenberg N, Nies A. Benign cost functions and lowness properties Journal of Symbolic Logic. 76: 289-312. DOI: 10.2178/Jsl/1294171001 |
0.385 |
|
2011 |
Greenberg N, Miller JS. Diagonally non-recursive functions and effective Hausdorff dimension Bulletin of the London Mathematical Society. 43: 636-654. DOI: 10.1112/Blms/Bdr003 |
0.389 |
|
2011 |
Downey RG, Greenberg N, Jockusch CG, Milans KG. Binary subtrees with few labeled paths Combinatorica. 31: 285-303. DOI: 10.1007/S00493-011-2634-3 |
0.356 |
|
2009 |
Greenberg N, Miller JS. Lowness for kurtz randomness Journal of Symbolic Logic. 74: 665-678. DOI: 10.2178/Jsl/1243948333 |
0.378 |
|
2009 |
Barmpalias G, Downey R, Greenberg N. Working with strong reducibilities above totally omega-c.e. and array computable degrees Transactions of the American Mathematical Society. 362: 777-813. DOI: 10.1090/S0002-9947-09-04910-1 |
0.387 |
|
2008 |
Greenberg N, Montalbán A. Ranked structures and arithmetic transfinite recursion Transactions of the American Mathematical Society. 360: 1265-1307. DOI: 10.1090/S0002-9947-07-04285-7 |
0.32 |
|
2008 |
Downey R, Greenberg N. Turing degrees of reals of positive effective packing dimension Information Processing Letters. 108: 298-303. DOI: 10.1016/J.Ipl.2008.05.028 |
0.34 |
|
2008 |
Downey R, Greenberg N, Miller JS. The upward closure of a perfect thin class Annals of Pure and Applied Logic. 156: 51-58. DOI: 10.1016/J.Apal.2008.06.006 |
0.335 |
|
2008 |
Cholak P, Downey R, Greenberg N. Strong jump-traceability I: The computably enumerable case Advances in Mathematics. 217: 2045-2074. DOI: 10.1016/J.Aim.2007.09.008 |
0.393 |
|
2007 |
Downey R, Greenberg N, Weber R. TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES Journal of Mathematical Logic. 7: 145-171. DOI: 10.1142/S0219061307000640 |
0.394 |
|
2006 |
Cholak P, Greenberg N, Miller JS. Uniform almost everywhere domination Journal of Symbolic Logic. 71: 1057-1072. DOI: 10.2178/Jsl/1154698592 |
0.344 |
|
2006 |
GREENBERG N, SHORE RA, SLAMAN TA. THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES Journal of Mathematical Logic. 6: 49-68. DOI: 10.1142/S0219061306000505 |
0.556 |
|
2006 |
Greenberg N. The role of true finiteness in the admissible recursively enumerable degrees Memoirs of the American Mathematical Society. 181: 1-110. DOI: 10.1090/Memo/0854 |
0.32 |
|
2004 |
Greenberg N, Montalbán A, Shore RA. Generalized high degrees have the complementation property Journal of Symbolic Logic. 69: 1200-1220. DOI: 10.2178/Jsl/1102022219 |
0.476 |
|
2003 |
Greenberg N, Montalbán A. Embedding and coding below a 1-generic degree Notre Dame Journal of Formal Logic. 44: 200-216. DOI: 10.1305/Ndjfl/1091122498 |
0.333 |
|
Show low-probability matches. |