| Publication | Date of Publication | Type |
|---|
| Represented spaces of represented spaces | 2025-11-19 | Paper |
Failure modes for structural highness notions
Journal of Logic and Computation | 2025-10-29 | Paper |
Computable classifications of continuous, transducer, and regular functions
Theoretical Computer Science | 2025-02-26 | Paper |
STRUCTURAL HIGHNESS NOTIONS
Journal of Symbolic Logic | 2023-12-22 | Paper |
| Free structures and limiting density | 2022-09-08 | Paper |
| A Church-Turing thesis for randomness? | 2022-03-22 | Paper |
Degrees of and lowness for isometric isomorphism
Journal of Logic and Analysis | 2021-01-22 | Paper |
| Computable classifications of continuous, transducer, and regular functions | 2020-10-19 | Paper |
Lowness for isomorphism, countable ideals, and computable traceability
Mathematical Logic Quarterly | 2020-05-29 | Paper |
| Key developments in algorithmic randomness | 2020-04-06 | Paper |
Taking the path computably traveled
Journal Of Logic And Computation | 2020-01-29 | Paper |
Algorithmic randomness and Fourier analysis
Theory of Computing Systems | 2019-06-27 | Paper |
Lowness for isomorphism and degrees of genericity
Computability | 2018-03-16 | Paper |
Strength and weakness in computable structure theory
Computability and Complexity | 2017-04-04 | Paper |
Randomness and non-ergodic systems
Moscow Mathematical Journal | 2016-04-22 | Paper |
Randomness and non-ergodic systems
Moscow Mathematical Journal | 2016-04-22 | Paper |
Genericity and UD-random reals
Journal of Logic and Analysis | 2015-08-27 | Paper |
Degrees that Are Low for Isomorphism
Computability | 2015-02-24 | Paper |
JSL volume 79 issue 2 Cover and Front matter
Journal of Symbolic Logic | 2014-12-05 | Paper |
Anti-complex sets and reducibilities with tiny use
Journal of Symbolic Logic | 2014-04-04 | Paper |
Anti-complex sets and reducibilities with tiny use
Journal of Symbolic Logic | 2014-04-04 | Paper |
Anti-complex sets and reducibilities with tiny use
Journal of Symbolic Logic | 2014-04-04 | Paper |
Lowness for difference tests
Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
Lowness for difference tests
Notre Dame Journal of Formal Logic | 2014-04-04 | Paper |
Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
Proceedings of the American Mathematical Society | 2013-09-03 | Paper |
Local computability for ordinals
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Schnorr Trivial Reals: A construction
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Degrees of categoricity and the hyperarithmetic hierarchy
Notre Dame Journal of Formal Logic | 2013-04-25 | Paper |
Relativizations of randomness and genericity notions
Bulletin of the London Mathematical Society | 2011-08-16 | Paper |
Van Lambalgen's theorem and high degrees
Notre Dame Journal of Formal Logic | 2011-06-03 | Paper |
Difference randomness
Proceedings of the American Mathematical Society | 2011-03-10 | Paper |
A superhigh diamond in the c.e. tt-degrees
Archive for Mathematical Logic | 2011-03-02 | Paper |
Subclasses of the weakly random reals
Notre Dame Journal of Formal Logic | 2010-12-01 | Paper |
Schnorr trivial sets and truth-table reducibility
Journal of Symbolic Logic | 2010-06-24 | Paper |
| scientific article; zbMATH DE number 5722526 (Why is no real title available?) | 2010-06-17 | Paper |
Schnorr triviality and genericity
Journal of Symbolic Logic | 2010-03-15 | Paper |
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Hyperimmune-free degrees and Schnorr triviality
Journal of Symbolic Logic | 2009-03-23 | Paper |
Schnorr trivial reals: a construction
Archive for Mathematical Logic | 2008-05-26 | Paper |
