Noam Greenberg

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 19

Top Topics

Randomly Distributed

Tomographic Reconstruction

Top Venues

Bull. Symb. Log.

Ann. Pure Appl. Log.

Publications

Rod Downey, Noam Greenberg, Long Qian
Some Open Questions and Recent Results on Computable Banach Spaces. CiE (2024)
Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky
Enumerations of families closed under finite differences. Comput. 13 (1) (2024)
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) (2022)
Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87 (1) (2022)
Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
Scott Complexity of Countable Structures. J. Symb. Log. 86 (4) (2021)
Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
Non-density in punctual computability. Ann. Pure Appl. Log. 172 (9) (2021)
Katherine Arthur, Rod Downey, Noam Greenberg
-c.a. degrees. Comput. 10 (3) (2021)
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
Punctual Categoricity and Universality. J. Symb. Log. 85 (4) (2020)
Noam Greenberg, Joseph S. Miller, André Nies
Computing from projections of random points. J. Math. Log. 20 (1) (2020)
Noam Greenberg, Keng Meng Ng, Guohua Wu
Cupping and jump Classes in the computably Enumerable Degrees. J. Symb. Log. 85 (4) (2020)
Noam Greenberg, Rutger Kuyper, Dan Turetsky
Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Comput. 8 (3-4) (2019)
Noam Greenberg, Dan Turetsky
Strong jump-Traceability. Bull. Symb. Log. 24 (2) (2018)
Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
Uniform Procedures in uncountable Structures. J. Symb. Log. 83 (2) (2018)
Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky
-Triviality. Notre Dame J. Formal Log. 59 (2) (2018)
Rod Downey, Noam Greenberg
A Hierarchy of computably Enumerable Degrees. Bull. Symb. Log. 24 (1) (2018)
Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick
Dimension 1 sequences are close to randoms. Theor. Comput. Sci. 705 (2018)
Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick
Dimension 1 sequences are close to randoms. CoRR (2017)
Laurent Bienvenu, Noam Greenberg, Benoit Monin
Continuous higher randomness. J. Math. Log. 17 (1) (2017)
Noam Greenberg
Editorial: Special Issue on Computability, Complexity and Randomness. Theory Comput. Syst. 58 (3) (2016)
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky
Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. 80 (1) (2015)
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. 80 (1) (2015)
Noam Greenberg, Saharon Shelah
Models of Cohen measurability. Ann. Pure Appl. Log. 165 (10) (2014)
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79 (2) (2014)
Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. 20 (1) (2014)
Noam Greenberg
Computing K-Trivial Sets by Incomplete Random Sets. CiE (2013)
Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. 23 (6) (2013)
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) (2013)
Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu
Anti-complex sets and reducibilities with tiny use. J. Symb. Log. 78 (4) (2013)
David Diamondstone, Noam Greenberg, Daniel Turetsky
Natural Large Degree Spectra. Comput. 2 (1) (2013)
Noam Greenberg, Antonio Montalbán, Theodore A. Slaman
Relative to any non-Hyperarithmetic Set. J. Math. Log. 13 (1) (2013)
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans
Binary subtrees with few labeled paths. Comb. 31 (3) (2011)
Noam Greenberg, André Nies
Benign cost functions and lowness properties. J. Symb. Log. 76 (1) (2011)
Noam Greenberg
A random set which only computes strongly jump-traceable c.e. sets. J. Symb. Log. 76 (2) (2011)
Noam Greenberg, Joseph S. Miller
Lowness for Kurtz randomness. J. Symb. Log. 74 (2) (2009)
Rod Downey, Noam Greenberg
Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108 (5) (2008)
Rod Downey, Noam Greenberg, Joseph S. Miller
The upward closure of a perfect thin class. Ann. Pure Appl. Log. 156 (1) (2008)
Rod Downey, Noam Greenberg, Rebecca Weber
Totally ω-computably Enumerable Degrees and Bounding Critical Triples. J. Math. Log. 7 (2) (2007)
Rod Downey, Noam Greenberg
-topped Degrees. TAMC (2006)
Noam Greenberg, Richard A. Shore, Theodore A. Slaman
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6 (1) (2006)
Sakaé Fuchino, Noam Greenberg, Saharon Shelah
Models of real-valued measurability. Ann. Pure Appl. Log. 142 (1-3) (2006)
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) (2006)
Peter Cholak, Noam Greenberg, Joseph S. Miller
Uniform almost everywhere domination. J. Symb. Log. 71 (3) (2006)
Noam Greenberg
The role of true finiteness in the admissible recursively enumerable degrees. Bull. Symb. Log. 11 (3) (2005)
Noam Greenberg, Antonio Montalbán, Richard A. Shore
Generalized high degrees have the complementation property. J. Symb. Log. 69 (4) (2004)
Noam Greenberg, Antonio Montalbán
Embedding and Coding below a 1-Generic Degree. Notre Dame J. Formal Log. 44 (4) (2003)