42 citations · 54 across the 13 of their papers we have counts for
1 paper · 2 filters
Adam Day, Andrew Marks
We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infin…