| Publication | Date of Publication | Type |
|---|
Iterated priority arguments in descriptive set theory
The Bulletin of Symbolic Logic | 2024-11-12 | Paper |
| Iterated Priority Arguments in Descriptive Set Theory | 2022-11-15 | Paper |
| An Effective Classification of Borel Wadge Classes | 2022-11-15 | Paper |
Three topological reducibilities for discontinuous functions
Transactions of the American Mathematical Society, Series B | 2022-10-28 | Paper |
| On a question of Slaman and Steel | 2020-03-31 | Paper |
Jump operations for Borel graphs
Journal of Symbolic Logic | 2018-05-02 | Paper |
| Algorithmic Randomness For Amenable Groups | 2018-02-11 | Paper |
Limits to joining with generics and randoms
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
ON THE STRENGTH OF TWO RECURRENCE THEOREMS
Journal of Symbolic Logic | 2017-04-28 | Paper |
Notes on computable analysis
Theory of Computing Systems | 2017-03-31 | Paper |
Density, forcing, and the covering problem
Mathematical Research Letters | 2015-07-28 | Paper |
Computuing \(K\)-trivial sets by incomplete random sets
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
Cupping with random sets
Proceedings of the American Mathematical Society | 2014-09-12 | Paper |
The typical Turing degree
Proceedings of the London Mathematical Society. Third Series | 2014-08-08 | Paper |
On process complexity
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
From bi-immunity to absolute undecidability
Journal of Symbolic Logic | 2014-04-04 | Paper |
From bi-immunity to absolute undecidability
Journal of Symbolic Logic | 2014-04-04 | Paper |
Independence, relative randomness, and PA degrees
Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
Independence, relative randomness, and PA degrees
Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
Randomness for non-computable measures
Transactions of the American Mathematical Society | 2013-09-04 | Paper |
Indifferent sets for genericity
Journal of Symbolic Logic | 2013-04-23 | Paper |
Process and truth-table characterisations of randomness
Theoretical Computer Science | 2012-10-11 | Paper |
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation | 2012-05-24 | Paper |
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation | 2012-05-24 | Paper |
Increasing the gap between descriptional complexity and algorithmic probability
Transactions of the American Mathematical Society | 2011-10-17 | Paper |
The computable Lipschitz degrees of computably enumerable sets are not dense
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Ergodic-Type Characterizations of Algorithmic Randomness
Programs, Proofs, Processes | 2010-07-29 | Paper |
On the computational power of random strings
Annals of Pure and Applied Logic | 2009-08-05 | Paper |
An algorithm for computing the effective linear elastic properties of heterogeneous materials: three-dimensional results for composites with equal phase Poisson ratios
Journal of the Mechanics and Physics of Solids | 1998-01-27 | Paper |
