×

zbMATH — the first resource for mathematics

Greenberg, Noam

Compute Distance To:
Author ID: greenberg.noam Recent zbMATH articles by "Greenberg, Noam"
Published as: Greenberg, Noam; Greenberg, N.
Documents Indexed: 71 Publications since 2003, including 2 Books
4 Contributions as Editor
Reviewing Activity: 10 Reviews

Publications by Year

Citations contained in zbMATH Open

58 Publications have been cited 319 times in 190 Documents Cited by Year
Strong jump-traceability. I: The computably enumerable case. Zbl 1134.03026
Cholak, Peter; Downey, Rod; Greenberg, Noam
20
2008
Lowness for Kurtz randomness. Zbl 1168.03033
Greenberg, Noam; Miller, Joseph S.
17
2009
Diagonally non-recursive functions and effective Hausdorff dimension. Zbl 1225.03055
Greenberg, Noam; Miller, Joseph S.
17
2011
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees. Zbl 1192.03014
Barmpalias, George; Downey, Rod; Greenberg, Noam
13
2010
Totally \(\omega\)-computably enumerable degrees and bounding critical triples. Zbl 1149.03032
Downey, Rod; Greenberg, Noam; Weber, Rebecca
12
2007
Computuing \(K\)-trivial sets by incomplete random sets. Zbl 1320.03074
Bienvenu, Laurent; Day, Adam R.; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
11
2014
Benign cost functions and lowness properties. Zbl 1221.03036
Greenberg, Noam; Nies, André
11
2011
Turing degrees of reals of positive effective packing dimension. Zbl 1191.68304
Downey, Rod; Greenberg, Noam
11
2008
Relative to any non-hyperarithmetic set. Zbl 1308.03050
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
10
2013
Uniform almost everywhere domination. Zbl 1109.03034
Cholak, Peter; Greenberg, Noam; Miller, Joseph S.
10
2006
Strong jump-traceability. II: \(K\)-triviality. Zbl 1273.03141
Downey, Rod; Greenberg, Noam
9
2012
Characterizing the strongly jump-traceable sets via randomness. Zbl 1257.03068
Greenberg, Noam; Hirschfeldt, Denis R.; Nies, André
9
2012
Coherent randomness tests and computing the \(K\)-trivial sets. Zbl 1375.03049
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Nies, André; Turetsky, Dan
9
2016
Continuous higher randomness. Zbl 1420.03100
Bienvenu, Laurent; Greenberg, Noam; Monin, Benoit
9
2017
Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets. Zbl 1298.03103
Franklin, Johanna N. Y.; Greenberg, Noam; Miller, Joseph S.; Ng, Keng Meng
8
2012
Ranked structures and arithmetic transfinite recursion. Zbl 1135.03026
Greenberg, Noam; Montalbán, Antonio
8
2008
Anti-complex sets and reducibilities with tiny use. Zbl 1307.03025
Franklin, Johanna N. Y.; Greenberg, Noam; Stephan, Frank; Wu, Guohua
7
2013
\(K\)-trivial degrees and the jump-traceability hierarchy. Zbl 1165.03024
Barmpalias, George; Downey, Rod; Greenberg, Noam
6
2009
Characterizing lowness for Demuth randomness. Zbl 1338.03080
Bienvenu, Laurent; Downey, Rod; Greenberg, Noam; Nies, André; Turetsky, Dan
6
2014
Strong jump-traceability and Demuth randomness. Zbl 1303.03074
Greenberg, Noam; Turetsky, Daniel D.
6
2014
Higher randomness and genericity. Zbl 1385.03042
Greenberg, Noam; Monin, Benoit
6
2017
A hierarchy of computably enumerable degrees. Zbl 06866160
Downey, Rod; Greenberg, Noam
6
2018
The role of true finiteness in the admissible recursively enumerable degrees. Zbl 1096.03052
Greenberg, Noam
5
2006
Lowness for computable machines. Zbl 1175.03025
Downey, Rod; Greenberg, Noam; Mihailović, Nenad; Nies, André
5
2008
A hierarchy of Turing degrees. A transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability. Zbl 07178475
Downey, Rod; Greenberg, Noam
5
2020
Effective mathematics of the uncountable. Zbl 1297.03006
4
2013
Uniform procedures in uncountable structures. Zbl 06915712
Greenberg, Noam; Melnikov, Alexander G.; Knight, Julia F.; Turetsky, Daniel
4
2018
Natural large degree spectra. Zbl 1308.03047
Diamondstone, David; Greenberg, Noam; Turetsky, Daniel
4
2013
Embedding and coding below a 1-generic degree. Zbl 1066.03045
Greenberg, Noam; Montalbán, Antonio
4
2003
Generalized high degrees have the complementation property. Zbl 1086.03030
Greenberg, Noam; Montalbán, Antonio; Shore, Richard A.
4
2004
The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
4
2011
Binary subtrees with few labeled paths. Zbl 1265.05593
Downey, Rodney G.; Greenberg, Noam; Jockusch, Carl G. jun.; Milans, Kevin G.
4
2011
Inherent enumerability of strong jump-traceability. Zbl 1375.03045
Diamondstone, David; Greenberg, Noam; Turetsky, Daniel D.
4
2015
\(K\)-trivials are never continuously random. Zbl 1296.03022
Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
3
2012
A random set which only computes strongly jump-traceable c.e. sets. Zbl 1220.03042
Greenberg, Noam
3
2011
Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Zbl 1352.03004
3
2017
Generic Muchnik reducibility and presentations of fields. Zbl 1403.03068
Downey, Rod; Greenberg, Noam; Miller, Joseph S.
3
2016
Computability and uncountable linear orders. I: Computable categoricity. Zbl 1359.03034
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
3
2015
Extensions of embeddings below computably enumerable degrees. Zbl 1296.03021
Downey, Rod; Greenberg, Noam; Lewis, Andrew; Montalbán, Antonio
3
2013
Models of real-valued measurability. Zbl 1099.03042
Fuchino, Sakae; Greenberg, Noam; Shelah, Saharon
3
2006
Computable structure theory on \(\omega_1\) using admissibility. Zbl 1369.03116
Greenberg, Noam; Knight, Julia F.
3
2013
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability. Zbl 1267.03047
Downey, Rod; Greenberg, Noam
3
2013
The finite intersection principle and genericity. Zbl 1375.03046
Diamondstone, David; Downey, Rod; Greenberg, Noam; Turetsky, Dan
3
2016
Punctual categoricity and universality. Zbl 07333589
Downey, Rod; Greenberg, Noam; Melnikov, Alexander; Meng Ng, Keng; Turetsky, Daniel
3
2020
Computability and uncountable linear orders. II: Degree spectra. Zbl 1359.03035
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
2
2015
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Zbl 07153158
Greenberg, Noam; Kuyper, Rutger; Turetsky, Dan
2
2019
Totally \(< \omega^{ \omega }\) computably enumerable and \(m\)-topped degrees. Zbl 1109.03039
Downey, Rod; Greenberg, Noam
2
2006
Finding bases of uncountable free abelian groups is usually difficult. Zbl 1414.03006
Greenberg, Noam; Turetsky, Dan; Westrick, Linda Brown
2
2018
Strong jump-traceability. Zbl 06916705
Greenberg, Noam; Turetsky, Dan
1
2018
The theory of the metarecursively enumerable degrees. Zbl 1109.03040
Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A.
1
2006
Every 1-generic computes a properly 1-generic. Zbl 1117.03052
Csima, Barbara F.; Downey, Rod; Greenberg, Noam; Hirschfeldt, Denis R.; Miller, Joseph S.
1
2006
The role of true finiteness in the admissible recursively enumerable degrees. Zbl 1098.03051
Greenberg, Noam
1
2005
Joining non-low c.e. sets with diagonally non-computable functions. Zbl 1327.03033
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
1
2013
A van Lambalgen theorem for Demuth randomness. Zbl 1364.03060
Diamondstone, David; Greenberg, Noam; Turetsky, Dan
1
2013
Prompt simplicity, array computability and cupping. Zbl 1156.03041
Downey, Rod; Greenberg, Noam; Miller, Joseph S.; Weber, Rebecca
1
2008
The upward closure of a perfect thin class. Zbl 1153.03018
Downey, Rod; Greenberg, Noam; Miller, Joseph S.
1
2008
Two more characterizations of \(K\)-triviality. Zbl 1453.03041
Greenberg, Noam; Miller, Joseph S.; Monin, Benoit; Turetsky, Daniel
1
2018
Effectively closed subgroups of the infinite symmetric group. Zbl 06963449
Greenberg, Noam; Melnikov, Alexander; Nies, Andre; Turetsky, Daniel
1
2018
A hierarchy of Turing degrees. A transfinite hierarchy of lowness notions in the computably enumerable degrees, unifying classes, and natural definability. Zbl 07178475
Downey, Rod; Greenberg, Noam
5
2020
Punctual categoricity and universality. Zbl 07333589
Downey, Rod; Greenberg, Noam; Melnikov, Alexander; Meng Ng, Keng; Turetsky, Daniel
3
2020
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Zbl 07153158
Greenberg, Noam; Kuyper, Rutger; Turetsky, Dan
2
2019
A hierarchy of computably enumerable degrees. Zbl 06866160
Downey, Rod; Greenberg, Noam
6
2018
Uniform procedures in uncountable structures. Zbl 06915712
Greenberg, Noam; Melnikov, Alexander G.; Knight, Julia F.; Turetsky, Daniel
4
2018
Finding bases of uncountable free abelian groups is usually difficult. Zbl 1414.03006
Greenberg, Noam; Turetsky, Dan; Westrick, Linda Brown
2
2018
Strong jump-traceability. Zbl 06916705
Greenberg, Noam; Turetsky, Dan
1
2018
Two more characterizations of \(K\)-triviality. Zbl 1453.03041
Greenberg, Noam; Miller, Joseph S.; Monin, Benoit; Turetsky, Daniel
1
2018
Effectively closed subgroups of the infinite symmetric group. Zbl 06963449
Greenberg, Noam; Melnikov, Alexander; Nies, Andre; Turetsky, Daniel
1
2018
Continuous higher randomness. Zbl 1420.03100
Bienvenu, Laurent; Greenberg, Noam; Monin, Benoit
9
2017
Higher randomness and genericity. Zbl 1385.03042
Greenberg, Noam; Monin, Benoit
6
2017
Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Zbl 1352.03004
3
2017
Coherent randomness tests and computing the \(K\)-trivial sets. Zbl 1375.03049
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Nies, André; Turetsky, Dan
9
2016
Generic Muchnik reducibility and presentations of fields. Zbl 1403.03068
Downey, Rod; Greenberg, Noam; Miller, Joseph S.
3
2016
The finite intersection principle and genericity. Zbl 1375.03046
Diamondstone, David; Downey, Rod; Greenberg, Noam; Turetsky, Dan
3
2016
Inherent enumerability of strong jump-traceability. Zbl 1375.03045
Diamondstone, David; Greenberg, Noam; Turetsky, Daniel D.
4
2015
Computability and uncountable linear orders. I: Computable categoricity. Zbl 1359.03034
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
3
2015
Computability and uncountable linear orders. II: Degree spectra. Zbl 1359.03035
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D.
2
2015
Computuing \(K\)-trivial sets by incomplete random sets. Zbl 1320.03074
Bienvenu, Laurent; Day, Adam R.; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
11
2014
Characterizing lowness for Demuth randomness. Zbl 1338.03080
Bienvenu, Laurent; Downey, Rod; Greenberg, Noam; Nies, André; Turetsky, Dan
6
2014
Strong jump-traceability and Demuth randomness. Zbl 1303.03074
Greenberg, Noam; Turetsky, Daniel D.
6
2014
Relative to any non-hyperarithmetic set. Zbl 1308.03050
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
10
2013
Anti-complex sets and reducibilities with tiny use. Zbl 1307.03025
Franklin, Johanna N. Y.; Greenberg, Noam; Stephan, Frank; Wu, Guohua
7
2013
Effective mathematics of the uncountable. Zbl 1297.03006
4
2013
Natural large degree spectra. Zbl 1308.03047
Diamondstone, David; Greenberg, Noam; Turetsky, Daniel
4
2013
Extensions of embeddings below computably enumerable degrees. Zbl 1296.03021
Downey, Rod; Greenberg, Noam; Lewis, Andrew; Montalbán, Antonio
3
2013
Computable structure theory on \(\omega_1\) using admissibility. Zbl 1369.03116
Greenberg, Noam; Knight, Julia F.
3
2013
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability. Zbl 1267.03047
Downey, Rod; Greenberg, Noam
3
2013
Joining non-low c.e. sets with diagonally non-computable functions. Zbl 1327.03033
Bienvenu, Laurent; Greenberg, Noam; Kučera, Antonín; Miller, Joseph S.; Nies, André; Turetsky, Dan
1
2013
A van Lambalgen theorem for Demuth randomness. Zbl 1364.03060
Diamondstone, David; Greenberg, Noam; Turetsky, Dan
1
2013
Strong jump-traceability. II: \(K\)-triviality. Zbl 1273.03141
Downey, Rod; Greenberg, Noam
9
2012
Characterizing the strongly jump-traceable sets via randomness. Zbl 1257.03068
Greenberg, Noam; Hirschfeldt, Denis R.; Nies, André
9
2012
Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets. Zbl 1298.03103
Franklin, Johanna N. Y.; Greenberg, Noam; Miller, Joseph S.; Ng, Keng Meng
8
2012
\(K\)-trivials are never continuously random. Zbl 1296.03022
Barmpalias, George; Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
3
2012
Diagonally non-recursive functions and effective Hausdorff dimension. Zbl 1225.03055
Greenberg, Noam; Miller, Joseph S.
17
2011
Benign cost functions and lowness properties. Zbl 1221.03036
Greenberg, Noam; Nies, André
11
2011
The Slaman-Wehner theorem in higher recursion theory. Zbl 1237.03020
Greenberg, Noam; Montalbán, Antonio; Slaman, Theodore A.
4
2011
Binary subtrees with few labeled paths. Zbl 1265.05593
Downey, Rodney G.; Greenberg, Noam; Jockusch, Carl G. jun.; Milans, Kevin G.
4
2011
A random set which only computes strongly jump-traceable c.e. sets. Zbl 1220.03042
Greenberg, Noam
3
2011
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees. Zbl 1192.03014
Barmpalias, George; Downey, Rod; Greenberg, Noam
13
2010
Lowness for Kurtz randomness. Zbl 1168.03033
Greenberg, Noam; Miller, Joseph S.
17
2009
\(K\)-trivial degrees and the jump-traceability hierarchy. Zbl 1165.03024
Barmpalias, George; Downey, Rod; Greenberg, Noam
6
2009
Strong jump-traceability. I: The computably enumerable case. Zbl 1134.03026
Cholak, Peter; Downey, Rod; Greenberg, Noam
20
2008
Turing degrees of reals of positive effective packing dimension. Zbl 1191.68304
Downey, Rod; Greenberg, Noam
11
2008
Ranked structures and arithmetic transfinite recursion. Zbl 1135.03026
Greenberg, Noam; Montalbán, Antonio
8
2008
Lowness for computable machines. Zbl 1175.03025
Downey, Rod; Greenberg, Noam; Mihailović, Nenad; Nies, André
5
2008
Prompt simplicity, array computability and cupping. Zbl 1156.03041
Downey, Rod; Greenberg, Noam; Miller, Joseph S.; Weber, Rebecca
1
2008
The upward closure of a perfect thin class. Zbl 1153.03018
Downey, Rod; Greenberg, Noam; Miller, Joseph S.
1
2008
Totally \(\omega\)-computably enumerable degrees and bounding critical triples. Zbl 1149.03032
Downey, Rod; Greenberg, Noam; Weber, Rebecca
12
2007
Uniform almost everywhere domination. Zbl 1109.03034
Cholak, Peter; Greenberg, Noam; Miller, Joseph S.
10
2006
The role of true finiteness in the admissible recursively enumerable degrees. Zbl 1096.03052
Greenberg, Noam
5
2006
Models of real-valued measurability. Zbl 1099.03042
Fuchino, Sakae; Greenberg, Noam; Shelah, Saharon
3
2006
Totally \(< \omega^{ \omega }\) computably enumerable and \(m\)-topped degrees. Zbl 1109.03039
Downey, Rod; Greenberg, Noam
2
2006
The theory of the metarecursively enumerable degrees. Zbl 1109.03040
Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A.
1
2006
Every 1-generic computes a properly 1-generic. Zbl 1117.03052
Csima, Barbara F.; Downey, Rod; Greenberg, Noam; Hirschfeldt, Denis R.; Miller, Joseph S.
1
2006
The role of true finiteness in the admissible recursively enumerable degrees. Zbl 1098.03051
Greenberg, Noam
1
2005
Generalized high degrees have the complementation property. Zbl 1086.03030
Greenberg, Noam; Montalbán, Antonio; Shore, Richard A.
4
2004
Embedding and coding below a 1-generic degree. Zbl 1066.03045
Greenberg, Noam; Montalbán, Antonio
4
2003
all top 5

Cited by 136 Authors

32 Greenberg, Noam
23 Nies, André Otfrid
22 Downey, Rodney Graham
13 Barmpalias, George
13 Miller, Joseph S.
12 Bienvenu, Laurent
11 Ng, KengMeng
9 Melnikov, Alexander G.
9 Montalbán, Antonio
9 Patey, Ludovic
8 Turetsky, Dan
7 Diamondstone, David E.
7 Kjos-Hanssen, Bjørn
7 Monin, Benoît
6 Merkle, Wolfgang
6 Porter, Christopher P.
6 Simpson, Stephen G.
6 Turetsky, Daniel D.
5 Knight, Julia F.
5 Stephan, Frank
5 Westrick, Linda Brown
5 Yu, Liang
4 Bazhenov, Nikolaĭ Alekseevich
4 Fan, Yun
4 Fokina, Ekaterina B.
4 Hölzl, Rupert
4 Kalimullin, Iskander Shagitovich
4 Khan, Mushfeq
4 Kučera, Antonín
4 Lempp, Steffen
4 Miyabe, Kenshi
4 Slaman, Theodore A.
3 Andrews, Uri
3 Cai, Mingzhong
3 Harrison-Trainor, Matthew
3 Hirschfeldt, Denis Roman
3 Jockusch, Carl G. jun.
3 Kihara, Takayuki
3 Lewis-Pye, Andrew E. M.
3 Lewis, Andrew E. M.
3 Rossegger, Dino
3 Rute, Jason
3 San Mauro, Luca
3 Schweber, Noah David
3 Selivanov, Viktor L’vovich
3 Shore, Richard A.
2 Ambos-Spies, Klaus
2 Brattka, Vasco
2 Cholak, Peter A.
2 Chong, Chi Tat
2 d’Auriac, Paul-Elliot Anglès
2 Day, Adam R.
2 Faizrakhmanov, Marat Kh.
2 Higuchi, Kojiro
2 Kräling, Thorsten
2 Kuyper, Rutger
2 McInerney, Michael
2 McNicholl, Timothy H.
2 Pauly, Arno M.
2 Shafer, Paul
2 Shelah, Saharon
2 Solomon, Reed
1 Allen, Kelty
1 Arthur, Katherine
1 Astor, Eric P.
1 Avigad, Jeremy
1 Baartse, Martijn
1 Badaev, Serikzhan A.
1 Bagaria, Joan
1 Beros, Achilles A.
1 Berti, Patrizia
1 Binns, Stephen
1 Brodhead, Paul
1 Brown, Tyler A.
1 Cai, Minzhong
1 Carl, Merlin
1 Carotenuto, Gemma
1 Cenzer, Douglas
1 Cole, Joshua A.
1 Conidis, Chris J.
1 Davie, George
1 Dean, Edward T.
1 Ding, Decheng
1 Dzhafarov, Damir D.
1 Ellison, Philip
1 Faĭzrahmanov, Marat Khaidarovich
1 Fang, Nan
1 Figueira, Santiago
1 Fouché, Willem Louw
1 Franklin, Johanna N. Y.
1 Frolov, Andrey N.
1 Galicki, Aleksander
1 Garti, Shimon
1 Goh, Jun Le
1 Gregoriades, Vassilios
1 Hammatt, Ellen
1 Hendtlass, Matthew Ralph John
1 Herbert, Ian
1 Hudelson, W. M. Phillip
1 Igusa, Greg
...and 36 more Authors

Citations by Year