Noam Greenberg

According to our database, Noam Greenberg authored at least 43 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Relationships between Computability-Theoretic Properties of Problems.

Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky

J. Symb. Log., 2022

Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021.

Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova

Comput., 2022

2021

Scott Complexity of Countable Structures.

Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky

J. Symb. Log., 2021

Maximality and collapse in the hierarchy of <i>α</i>-c.a. degrees.

Katherine Arthur, Rod Downey, Noam Greenberg

Comput., 2021

Non-density in punctual computability.

Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky

Ann. Pure Appl. Log., 2021

2020

Cupping and jump Classes in the computably Enumerable Degrees.

Noam Greenberg, Keng Meng Ng, Guohua Wu

J. Symb. Log., 2020

Punctual Categoricity and Universality.

Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky

J. Symb. Log., 2020

Computing from projections of random points.

Noam Greenberg, Joseph S. Miller, André Nies

J. Math. Log., 2020

2019

Cardinal invariants, non-lowness classes, and Weihrauch reducibility.

Noam Greenberg, Rutger Kuyper, Dan Turetsky

Comput., 2019

2018

Dimension 1 sequences are close to randoms.

Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick

Theor. Comput. Sci., 2018

Two More Characterizations of <i>K</i>-Triviality.

Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky

Notre Dame J. Formal Log., 2018

Uniform Procedures in uncountable Structures.

Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky

J. Symb. Log., 2018

Strong jump-Traceability.

Noam Greenberg, Dan Turetsky

Bull. Symb. Log., 2018

A Hierarchy of computably Enumerable Degrees.

Rod Downey, Noam Greenberg

Bull. Symb. Log., 2018

2017

Continuous higher randomness.

Laurent Bienvenu, Noam Greenberg, Benoit Monin

J. Math. Log., 2017

2016

Editorial: Special Issue on Computability, Complexity and Randomness.

Noam Greenberg

Theory Comput. Syst., 2016

2015

Computability and uncountable Linear Orders II: degree spectra.

Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky

J. Symb. Log., 2015

Computability and uncountable Linear Orders I: Computable Categoricity.

Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky

J. Symb. Log., 2015

2014

Characterizing Lowness for Demuth Randomness.

Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky

J. Symb. Log., 2014

Computing k-Trivial Sets by Incomplete Random Sets.

Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky

Bull. Symb. Log., 2014

Models of Cohen measurability.

Noam Greenberg, Saharon Shelah

Ann. Pure Appl. Log., 2014

2013

Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle.

Chris J. Conidis, Noam Greenberg, Daniel Turetsky

Notre Dame J. Formal Log., 2013

Joining non-low C.E. sets with diagonally non-computable functions.

Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky

J. Log. Comput., 2013

Anti-complex sets and reducibilities with tiny use.

Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu

J. Symb. Log., 2013

Relative to any non-Hyperarithmetic Set.

Noam Greenberg, Antonio Montalbán, Theodore A. Slaman

J. Math. Log., 2013

Natural Large Degree Spectra.

David Diamondstone, Noam Greenberg, Daniel Turetsky

Comput., 2013

Computing K-Trivial Sets by Incomplete Random Sets.

Noam Greenberg

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2011

Benign cost functions and lowness properties.

Noam Greenberg, André Nies

J. Symb. Log., 2011

A random set which only computes strongly jump-traceable c.e. sets.

Noam Greenberg

J. Symb. Log., 2011

Binary subtrees with few labeled paths.

Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans

Comb., 2011

2009

Lowness for Kurtz randomness.

Noam Greenberg, Joseph S. Miller

J. Symb. Log., 2009

2008

Turing degrees of reals of positive effective packing dimension.

Rod Downey, Noam Greenberg

Inf. Process. Lett., 2008

The upward closure of a perfect thin class.

Rod Downey, Noam Greenberg, Joseph S. Miller

Ann. Pure Appl. Log., 2008

2007

Totally ω-computably Enumerable Degrees and Bounding Critical Triples.

Rod Downey, Noam Greenberg, Rebecca Weber

J. Math. Log., 2007

2006

Every 1-generic computes a properly 1-generic.

Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller

J. Symb. Log., 2006

Uniform almost everywhere domination.

Peter Cholak, Noam Greenberg, Joseph S. Miller

J. Symb. Log., 2006

The Theory of the Metarecursively Enumerable Degrees.

Noam Greenberg, Richard A. Shore, Theodore A. Slaman

J. Math. Log., 2006

Models of real-valued measurability.

Sakaé Fuchino, Noam Greenberg, Saharon Shelah

Ann. Pure Appl. Log., 2006

Totally < ω^ω Computably Enumerable and <i>m</i>-topped Degrees.

Rod Downey, Noam Greenberg

Proceedings of the Theory and Applications of Models of Computation, 2006

The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.

Noam Greenberg

Memoirs of the American Mathematical Society 854, American Mathematical Society, ISBN: 978-0-8218-3885-3, 2006

2005

The role of true finiteness in the admissible recursively enumerable degrees.

Noam Greenberg

Bull. Symb. Log., 2005

2004

Generalized high degrees have the complementation property.

Noam Greenberg, Antonio Montalbán, Richard A. Shore

J. Symb. Log., 2004

2003

Embedding and Coding below a 1-Generic Degree.

Noam Greenberg, Antonio Montalbán

Notre Dame J. Formal Log., 2003