73 citations · 77 across the 8 of their papers we have counts for
8 papers
Comparing Notions of Dense Computability on and
Peter M. Gerdes
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popula…
The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
Leo A. Harrington, Peter M. Gerdes
This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable…
A Singleton of Minimal Arithmetic Degree
Peter Gerdes
In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, () the -REA sets play a role analogous to the role the r.e. d…
Extending Properly n-REA Sets
Peter A. Cholak, Peter M. Gerdes
In [5] Soare and Stob prove that if is an r.e. set which isn't computable then there is a set of the form which isn't of r.e. Turing degree. If we define a pro…
-maximal sets
Peter Cholak, Peter Gerdes, Karen Lange
Soare proved that the maximal sets form an orbit in . We consider here -maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer. S…
Harrington's Solution to McLaughlin's Conjecture and Non-uniform Self-moduli
Peter M. Gerdes
While much work has been done to characterize the Turing degrees computing members of various collections of fast growing functions, much less has been done to characterize the rat…