| Publication | Date of Publication | Type |
|---|
| Automatic complexity. A computable measure of irregularity | 2023-11-07 | Paper |
| Conditional automatic complexity and its metrics | 2023-08-30 | Paper |
| Interpolating between the Jaccard distance and an analogue of the normalized information distance | 2023-01-04 | Paper |
| Strong Medvedev reducibilities and the KL-randomness problem | 2022-12-07 | Paper |
| The number of languages with maximum state complexity | 2022-08-01 | Paper |
| A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance | 2022-07-01 | Paper |
| Maximal automatic complexity and context-free languages | 2022-06-21 | Paper |
| Strong Medvedev reducibilities and the KL-randomness problem | 2022-04-28 | Paper |
| On the degrees of constructively immune sets | 2022-03-22 | Paper |
| KL-randomness and effective dimension under strong reducibility | 2022-03-22 | Paper |
| VC-dimensions of nondeterministic finite automata for words of equal length | 2022-02-14 | Paper |
| An incompressibility theorem for automatic complexity | 2021-10-05 | Paper |
| On the degrees of constructively immune sets | 2021-04-27 | Paper |
| KL-randomness and effective dimension under strong reducibility | 2021-04-27 | Paper |
| Extracting randomness within a subset is hard | 2021-04-20 | Paper |
| Automatic complexity of Fibonacci and tribonacci words | 2020-12-29 | Paper |
| From eventually different functions to pandemic numberings | 2020-02-03 | Paper |
| Planar digraphs for automatic complexity | 2019-10-15 | Paper |
| The number of languages with maximum state complexity | 2019-10-15 | Paper |
| A tractable case of the Turing automorphism problem: bi-uniformly $E_0$-invariant Cantor homeomorphisms | 2019-08-14 | Paper |
| Only Human | 2019-06-11 | Paper |
| Few Paths, Fewer Words: Model Selection With Automatic Structure Functions | 2019-05-08 | Paper |
| Planar digraphs for automatic complexity | 2019-02-02 | Paper |
| Pricing complexity options | 2018-09-13 | Paper |
| From eventually different functions to pandemic numberings | 2018-09-06 | Paper |
| PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES | 2018-08-13 | Paper |
| Automatic complexity of shift register sequences | 2018-07-26 | Paper |
| On the complexity of automatic complexity | 2018-02-01 | Paper |
| Shift registers fool finite automata | 2017-12-20 | Paper |
| Superposition as memory: unlocking quantum automatic complexity | 2017-08-31 | Paper |
| A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations | 2017-04-07 | Paper |
| A Rigid Cone in the Truth-Table Degrees with Jump | 2017-04-04 | Paper |
| Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees | 2017-04-04 | Paper |
| Effective Bi-immunity and Randomness | 2017-04-04 | Paper |
| Covering the recursive sets | 2017-02-08 | Paper |
| The strength of the Grätzer-Schmidt theorem | 2017-02-02 | Paper |
| Models of the Chisholm set | 2016-07-07 | Paper |
| Constructing a weak subset of a random set | 2016-02-11 | Paper |
| Kolmogorov structure functions for automatic complexity | 2015-12-11 | Paper |
| Covering the Recursive Sets | 2015-10-20 | Paper |
| Arithmetic complexity via effective names for random sequences | 2015-09-17 | Paper |
| Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics | 2015-09-11 | Paper |
| Nondeterministic automatic complexity of overlap-free and almost square-free words | 2015-08-27 | Paper |
| Algorithmic randomness for Doob's martingale convergence theorem in continuous time | 2015-01-15 | Paper |
| Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words | 2014-09-26 | Paper |
| Finding subsets of positive measure | 2014-08-08 | Paper |
| Algorithmic Aspects of Lipschitz Functions | 2014-06-19 | Paper |
| How much randomness is needed for statistics? | 2014-06-06 | Paper |
| Randomness extraction and asymptotic Hamming distance | 2013-09-26 | Paper |
| The probability distribution as a computational resource for randomness testing | 2012-12-17 | Paper |
| How much randomness is needed for statistics? | 2012-08-14 | Paper |
| Effective Banach spaces | 2012-07-27 | Paper |
| Lowness notions, measure and domination | 2012-06-08 | Paper |
| Martin-Löf randomness and Galton-Watson processes | 2012-03-13 | Paper |
| A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS | 2011-10-24 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2011-10-17 | Paper |
| Kolmogorov complexity and strong approximation of Brownian motion | 2011-10-11 | Paper |
| Higher Kurtz randomness | 2011-08-26 | Paper |
| Superhighness | 2010-09-02 | Paper |
| The Strength of the Besicovitch-Davies Theorem | 2010-07-29 | Paper |
| The strength of the Grätzer-Schmidt theorem | 2010-07-28 | Paper |
| Numberings and Randomness | 2010-07-28 | Paper |
| Members of Random Closed Sets | 2010-07-28 | Paper |
| Lattice initial segments of the hyperdegrees | 2010-03-15 | Paper |
| Self-embeddings of computable trees | 2010-01-13 | Paper |
| Infinite subsets of random sets of integers | 2009-04-28 | Paper |
| Finding paths through narrow and wide trees | 2009-03-25 | Paper |
| Effective dimension of points visited by Brownian motion | 2009-03-02 | Paper |
| Lattice initial segments of the Turing degrees | 2009-01-25 | Paper |
| The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs | 2008-10-20 | Paper |
| Kolmogorov complexity and the Recursion Theorem | 2008-03-19 | Paper |
| The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion | 2008-01-04 | Paper |
| Low for random reals and positive-measure domination | 2007-09-27 | Paper |
| On a conjecture of Dobrinen and Simpson concerning almost everywhere domination | 2006-07-05 | Paper |
| Lowness for the Class of Schnorr Random Reals | 2006-06-01 | Paper |
| Comparing DNR and WWKL | 2005-08-29 | Paper |
| Local Initial Segments of The Turing Degrees | 2003-10-27 | Paper |
