default search action
Noam Greenberg
Person information
- affiliation: Victoria University of Wellington, NZ
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j41]Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky:
Enumerations of families closed under finite differences. Comput. 13(1): 89-104 (2024) - [c3]Rod Downey, Noam Greenberg, Long Qian:
Some Open Questions and Recent Results on Computable Banach Spaces. CiE 2024: 10-26 - 2022
- [j40]Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova:
Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. 11(3-4): 163 (2022) - [j39]Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky:
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87(1): 47-71 (2022) - 2021
- [j38]Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov
, Dan Turetsky:
Non-density in punctual computability. Ann. Pure Appl. Log. 172(9): 102985 (2021) - [j37]Katherine Arthur, Rod Downey, Noam Greenberg:
Maximality and collapse in the hierarchy of α-c.a. degrees. Comput. 10(3): 181-214 (2021) - [j36]Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky:
Scott Complexity of Countable Structures. J. Symb. Log. 86(4): 1706-1720 (2021) - 2020
- [j35]Noam Greenberg, Joseph S. Miller
Computing from projections of random points. J. Math. Log. 20(1): 1950014 (2020) - [j34]Rod Downey, Noam Greenberg, Alexander G. Melnikov
Punctual Categoricity and Universality. J. Symb. Log. 85(4): 1427-1466 (2020) - [j33]Noam Greenberg, Keng Meng Ng, Guohua Wu:
Cupping and jump Classes in the computably Enumerable Degrees. J. Symb. Log. 85(4): 1499-1545 (2020)
2010 – 2019
- 2019
- [j32]Noam Greenberg, Rutger Kuyper, Dan Turetsky:
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Comput. 8(3-4): 305-346 (2019) - 2018
- [j31]Rod Downey, Noam Greenberg:
A Hierarchy of computably Enumerable Degrees. Bull. Symb. Log. 24(1): 53-89 (2018) - [j30]Noam Greenberg, Dan Turetsky:
Strong jump-Traceability. Bull. Symb. Log. 24(2): 147-164 (2018) - [j29]Noam Greenberg, Alexander G. Melnikov
Uniform Procedures in uncountable Structures. J. Symb. Log. 83(2): 529-550 (2018) - [j28]Noam Greenberg, Joseph S. Miller
Two More Characterizations of K-Triviality. Notre Dame J. Formal Log. 59(2): 189-195 (2018) - [j27]Noam Greenberg, Joseph S. Miller
Dimension 1 sequences are close to randoms. Theor. Comput. Sci. 705: 99-112 (2018) - 2017
- [j26]Laurent Bienvenu, Noam Greenberg, Benoit Monin:
Continuous higher randomness. J. Math. Log. 17(1): 1750004:1-1750004:53 (2017) - [e1]Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents] - [i1]Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick:
Dimension 1 sequences are close to randoms. CoRR abs/1709.05266 (2017) - 2016
- [j25]Noam Greenberg:
Editorial: Special Issue on Computability, Complexity and Randomness. Theory Comput. Syst. 58(3): 381-382 (2016) - 2015
- [j24]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky:
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80(1): 116-144 (2015) - [j23]Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky:
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80(1): 145-178 (2015) - 2014
- [j22]Noam Greenberg, Saharon Shelah
Models of Cohen measurability. Ann. Pure Appl. Log. 165(10): 1557-1576 (2014) - [j21]Laurent Bienvenu, Adam R. Day
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20(1): 80-90 (2014) - [j20]Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79(2): 526-560 (2014) - 2013
- [j19]David Diamondstone, Noam Greenberg, Daniel Turetsky:
Natural Large Degree Spectra. Comput. 2(1): 1-8 (2013) - [j18]Noam Greenberg, Antonio Montalbán, Theodore A. Slaman:
Relative to any non-Hyperarithmetic Set. J. Math. Log. 13(1): 1250007 (2013) - [j17]Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan
Anti-complex sets and reducibilities with tiny use. J. Symb. Log. 78(4): 1307-1327 (2013) - [j16]Laurent Bienvenu, Noam Greenberg, Antonín Kucera
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23(6): 1183-1194 (2013) - [j15]Chris J. Conidis, Noam Greenberg, Daniel Turetsky:
Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. Notre Dame J. Formal Log. 54(2): 233-252 (2013) - [c2]Noam Greenberg:
Computing K-Trivial Sets by Incomplete Random Sets. CiE 2013: 230 - 2011
- [j14]Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans:
Binary subtrees with few labeled paths. Comb. 31(3): 285-303 (2011) - [j13]Noam Greenberg, André Nies
Benign cost functions and lowness properties. J. Symb. Log. 76(1): 289-312 (2011) - [j12]Noam Greenberg:
A random set which only computes strongly jump-traceable c.e. sets. J. Symb. Log. 76(2): 700-718 (2011)
2000 – 2009
- 2009
- [j11]Noam Greenberg, Joseph S. Miller
Lowness for Kurtz randomness. J. Symb. Log. 74(2): 665-678 (2009) - 2008
- [j10]Rod Downey, Noam Greenberg, Joseph S. Miller
The upward closure of a perfect thin class. Ann. Pure Appl. Log. 156(1): 51-58 (2008) - [j9]Rod Downey, Noam Greenberg:
Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008) - 2007
- [j8]Rod Downey, Noam Greenberg, Rebecca Weber:
Totally ω-computably Enumerable Degrees and Bounding Critical Triples. J. Math. Log. 7(2) (2007) - 2006
- [b1]Noam Greenberg:
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Memoirs of the American Mathematical Society 854, American Mathematical Society 2006, ISBN 978-0-8218-3885-3, pp. I-VI, 1-99 - [j7]Sakaé Fuchino, Noam Greenberg, Saharon Shelah
Models of real-valued measurability. Ann. Pure Appl. Log. 142(1-3): 380-397 (2006) - [j6]Noam Greenberg, Richard A. Shore, Theodore A. Slaman:
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6(1) (2006) - [j5]Peter Cholak, Noam Greenberg, Joseph S. Miller
Uniform almost everywhere domination. J. Symb. Log. 71(3): 1057-1072 (2006) - [j4]Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller
Every 1-generic computes a properly 1-generic. J. Symb. Log. 71(4): 1385-1393 (2006) - [c1]Rod Downey, Noam Greenberg:
Totally < ωω Computably Enumerable and m-topped Degrees. TAMC 2006: 46-60 - 2005
- [j3]Noam Greenberg:
The role of true finiteness in the admissible recursively enumerable degrees. Bull. Symb. Log. 11(3): 398-410 (2005) - 2004
- [j2]Noam Greenberg, Antonio Montalbán, Richard A. Shore:
Generalized high degrees have the complementation property. J. Symb. Log. 69(4): 1200-1220 (2004) - 2003
- [j1]Noam Greenberg, Antonio Montalbán:
Embedding and Coding below a 1-Generic Degree. Notre Dame J. Formal Log. 44(4): 200-216 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: