4 citations · 4 across the 3 of their papers we have counts for
3 papers
math.LO2026
Characterising SJT reducibility
Noam Greenberg, Andre Nies, Dan Turetsky
SJT reducibility between sets is defined by if for each computable function that is unbounded and nondecreasing, there is an -bound…
math.LO2021
Maximal towers and ultrafilter bases in computability
Steffen Lempp, Joseph S. Miller, Andre Nies +1
The tower number and the ultrafilter number are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subse…
math.LO2013★ 4 cited
Computing K-Trivial Sets by Incomplete Random Sets
Laurent Bienvenu, Adam R. Day, Noam Greenberg +4
Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute 0'.