42 citations · 54 across the 13 of their papers we have counts for
16 papers
An Effective Classification of Borel Wadge Classes
Adam Day, Noam Greenberg, Matthew Harrison-Trainor +1
We give a new and effective classification of all Borel Wadge classes of subsets of Baire space. This relies on the true stage machinery originally developed by Montalbán. We use t…
Iterated Priority Arguments in Descriptive Set Theory
Adam Day, Noam Greenberg, Matthew Harrison-Trainor +1
We present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff-Kuratowski and Wadge th…
Exploratory analysis of text duplication in peer-review reveals peer-review fraud and paper mills
Adam Day
Comments received from referees during peer-review were analysed to determine the rates of duplication and partial duplication. It is very unusual for 2 different referees to submi…
On a question of Slaman and Steel
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…
Three topological reducibilities for discontinuous functions
Adam R. Day, Rod Downey, Linda Brown Westrick
We define a family of three related reducibilities, , and , for arbitrary functions , where is a compact separable metric…
Algorithmic Randomness For Amenable Groups
Adam R. Day
We develop the theory of algorithmic randomness for the space where is a finite alphabet and is a computable amenable group. We give an effective version of the Shann…