Peter M. Gerdes

activity

20102025

most citedComputably Enumerable Equivalence Relations

73 citations · 77 across the 8 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.LO2025

Comparing Notions of Dense Computability on $ω^{ω}$ and $2^{ω}$

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…

math.LO2025

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…

Comparing Notions of Dense Computability on ωω and 2ω

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond

Comparing Notions of Dense Computability on $ω^{ω}$ and $2^{ω}$