Noam Greenberg

50 papers C 3Journal 45

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The geometry of computable Banach spaces. Inf. Comput. Rod Downey, Noam Greenberg, Long Qian, Ruofei Xie
2024	J	`jnl`	Algorithmically random series. Comput. Rodney G. Downey, Noam Greenberg, Andrew Tanggara
2024	J	`jnl`	Enumerations of families closed under finite differences. Comput. Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller, Dan Turetsky
2024	J	`jnl`	Iterated Priority Arguments in Descriptive Set Theory. Bull. Symb. Log. Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
2024	C	`conf`	Some Open Questions and Recent Results on Computable Banach Spaces. CiE Rod Downey, Noam Greenberg, Long Qian
2022	J	`jnl`	Preface of the Special Issue for the Oberwolfach Workshop on Computability Theory 2021. Comput. Vasco Brattka, Noam Greenberg, Iskander Sh. Kalimullin, Mariya Ivanova Soskova
2022	J	`jnl`	Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky
2021	J	`jnl`	Maximality and collapse in the hierarchy of Comput. Katherine Arthur, Rod Downey, Noam Greenberg
2021	J	`jnl`	Non-density in punctual computability. Ann. Pure Appl. Log. Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
2021	J	`jnl`	Scott Complexity of Countable Structures. J. Symb. Log. Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor, Dan Turetsky
2020	J	`jnl`	Computing from projections of random points. J. Math. Log. Noam Greenberg, Joseph S. Miller, André Nies
2020	J	`jnl`	Cupping and jump Classes in the computably Enumerable Degrees. J. Symb. Log. Noam Greenberg, Keng Meng Ng, Guohua Wu
2020	J	`jnl`	Punctual Categoricity and Universality. J. Symb. Log. Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
2019	J	`jnl`	Cardinal invariants, non-lowness classes, and Weihrauch reducibility. Comput. Noam Greenberg, Rutger Kuyper, Dan Turetsky
2018	J	`jnl`	A Hierarchy of computably Enumerable Degrees. Bull. Symb. Log. Rod Downey, Noam Greenberg
2018	J	`jnl`	Dimension 1 sequences are close to randoms. Theor. Comput. Sci. Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick
2018	J	`jnl`	Strong jump-Traceability. Bull. Symb. Log. Noam Greenberg, Dan Turetsky
2018	J	`jnl`	Two More Characterizations of Notre Dame J. Formal Log. Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky
2018	J	`jnl`	Uniform Procedures in uncountable Structures. J. Symb. Log. Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
2017	—	`ed.`	Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Computability and Complexity Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond
2017	J	`jnl`	Continuous higher randomness. J. Math. Log. Laurent Bienvenu, Noam Greenberg, Benoit Monin
2017	J	`jnl`	Dimension 1 sequences are close to randoms. CoRR Noam Greenberg, Joseph S. Miller, Alexander Shen, Linda Brown Westrick
2016	J	`jnl`	Editorial: Special Issue on Computability, Complexity and Randomness. Theory Comput. Syst. Noam Greenberg
2015	J	`jnl`	Computability and uncountable Linear Orders I: Computable Categoricity. J. Symb. Log. Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky
2015	J	`jnl`	Computability and uncountable Linear Orders II: degree spectra. J. Symb. Log. Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky
2014	J	`jnl`	Characterizing Lowness for Demuth Randomness. J. Symb. Log. Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
2014	J	`jnl`	Computing k-Trivial Sets by Incomplete Random Sets. Bull. Symb. Log. Laurent Bienvenu, Adam R. Day, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Dan Turetsky
2014	J	`jnl`	Models of Cohen measurability. Ann. Pure Appl. Log. Noam Greenberg, Saharon Shelah
2013	J	`jnl`	Anti-complex sets and reducibilities with tiny use. J. Symb. Log. Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, Guohua Wu
2013	C	`conf`	Computing K-Trivial Sets by Incomplete Random Sets. CiE Noam Greenberg
2013	J	`jnl`	Galvin's "Racing Pawns" Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle. Notre Dame J. Formal Log. Chris J. Conidis, Noam Greenberg, Daniel Turetsky
2013	J	`jnl`	Joining non-low C.E. sets with diagonally non-computable functions. J. Log. Comput. Laurent Bienvenu, Noam Greenberg, Antonín Kucera, Joseph S. Miller, André Nies, Daniel Turetsky
2013	J	`jnl`	Natural Large Degree Spectra. Comput. David Diamondstone, Noam Greenberg, Daniel Turetsky
2013	J	`jnl`	Relative to any non-Hyperarithmetic Set. J. Math. Log. Noam Greenberg, Antonio Montalbán, Theodore A. Slaman
2011	J	`jnl`	A random set which only computes strongly jump-traceable c.e. sets. J. Symb. Log. Noam Greenberg
2011	J	`jnl`	Benign cost functions and lowness properties. J. Symb. Log. Noam Greenberg, André Nies
2011	J	`jnl`	Binary subtrees with few labeled paths. Comb. Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans
2009	J	`jnl`	Lowness for Kurtz randomness. J. Symb. Log. Noam Greenberg, Joseph S. Miller
2008	J	`jnl`	The upward closure of a perfect thin class. Ann. Pure Appl. Log. Rod Downey, Noam Greenberg, Joseph S. Miller
2008	J	`jnl`	Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. Rod Downey, Noam Greenberg
2007	J	`jnl`	Totally ω-computably Enumerable Degrees and Bounding Critical Triples. J. Math. Log. Rod Downey, Noam Greenberg, Rebecca Weber
2006	J	`jnl`	Every 1-generic computes a properly 1-generic. J. Symb. Log. Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller
2006	J	`jnl`	Models of real-valued measurability. Ann. Pure Appl. Log. Sakaé Fuchino, Noam Greenberg, Saharon Shelah
2006	—	`book`	The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Noam Greenberg
2006	J	`jnl`	The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. Noam Greenberg, Richard A. Shore, Theodore A. Slaman
2006	C	`conf`	Totally < ω TAMC Rod Downey, Noam Greenberg
2006	J	`jnl`	Uniform almost everywhere domination. J. Symb. Log. Peter Cholak, Noam Greenberg, Joseph S. Miller
2005	J	`jnl`	The role of true finiteness in the admissible recursively enumerable degrees. Bull. Symb. Log. Noam Greenberg
2004	J	`jnl`	Generalized high degrees have the complementation property. J. Symb. Log. Noam Greenberg, Antonio Montalbán, Richard A. Shore
2003	J	`jnl`	Embedding and Coding below a 1-Generic Degree. Notre Dame J. Formal Log. Noam Greenberg, Antonio Montalbán