| Publication | Date of Publication | Type |
|---|
| Conditional automatic complexity and its metrics | 2024-08-22 | Paper |
Automatic complexity. A computable measure of irregularity
De Gruyter Series in Logic and Its Applications | 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
Journal Of Logic And Computation | 2023-01-04 | Paper |
Strong Medvedev reducibilities and the KL-randomness problem
(available as arXiv preprint) | 2022-12-07 | Paper |
The number of languages with maximum state complexity
Algebra Universalis | 2022-08-01 | Paper |
A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance
(available as arXiv preprint) | 2022-07-01 | Paper |
| Maximal automatic complexity and context-free languages | 2022-06-21 | Paper |
Strong Medvedev reducibilities and the KL-randomness problem
(available as arXiv preprint) | 2022-04-28 | Paper |
KL-randomness and effective dimension under strong reducibility
(available as arXiv preprint) | 2022-03-22 | Paper |
On the degrees of constructively immune sets
(available as arXiv preprint) | 2022-03-22 | Paper |
VC-dimensions of nondeterministic finite automata for words of equal length
Annals of Mathematics and Artificial Intelligence | 2022-02-14 | Paper |
An incompressibility theorem for automatic complexity
Forum of Mathematics, Sigma | 2021-10-05 | Paper |
On the degrees of constructively immune sets
(available as arXiv preprint) | 2021-04-27 | Paper |
KL-randomness and effective dimension under strong reducibility
(available as arXiv preprint) | 2021-04-27 | Paper |
Extracting randomness within a subset is hard
European Journal of Mathematics | 2021-04-20 | Paper |
Automatic complexity of Fibonacci and tribonacci words
Discrete Applied Mathematics | 2020-12-29 | Paper |
From eventually different functions to pandemic numberings
(available as arXiv preprint) | 2020-02-03 | Paper |
Planar digraphs for automatic complexity
(available as arXiv preprint) | 2019-10-15 | Paper |
The number of languages with maximum state complexity
Lecture Notes in Computer Science | 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
Notices of the American Mathematical Society | 2019-06-11 | Paper |
Few Paths, Fewer Words: Model Selection With Automatic Structure Functions
Experimental Mathematics | 2019-05-08 | Paper |
Planar digraphs for automatic complexity
(available as arXiv preprint) | 2019-02-02 | Paper |
Pricing complexity options
Algorithmic Finance | 2018-09-13 | Paper |
From eventually different functions to pandemic numberings
(available as arXiv preprint) | 2018-09-06 | Paper |
Permutations of the integers induce only the trivial automorphism of the Turing degrees
The Bulletin of Symbolic Logic | 2018-08-13 | Paper |
Automatic complexity of shift register sequences
Discrete Mathematics | 2018-07-26 | Paper |
On the complexity of automatic complexity
Theory of Computing Systems | 2018-02-01 | Paper |
| Shift registers fool finite automata | 2017-12-20 | Paper |
Superposition as memory: unlocking quantum automatic complexity
(available as arXiv preprint) | 2017-08-31 | Paper |
A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations
Studia Logica | 2017-04-07 | Paper |
Effective bi-immunity and randomness
Computability and Complexity | 2017-04-04 | Paper |
A Rigid Cone in the Truth-Table Degrees with Jump
Computability and Complexity | 2017-04-04 | Paper |
Permutations of the integers induce only the trivial automorphism of the Turing degrees
Computability and Complexity | 2017-04-04 | Paper |
Covering the recursive sets
Annals of Pure and Applied Logic | 2017-02-08 | Paper |
The strength of the Grätzer-Schmidt theorem
Archive for Mathematical Logic | 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
Theoretical Computer Science | 2015-12-11 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Kolmogorov structure functions for automatic complexity in computational statistics
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Nondeterministic automatic complexity of overlap-free and almost square-free words
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Nondeterministic automatic complexity of overlap-free and almost square-free words
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Algorithmic randomness for Doob's martingale convergence theorem in continuous time
Logical Methods in Computer Science | 2015-01-15 | Paper |
Nondeterministic automatic complexity of almost square-free and strongly cube-free words
Lecture Notes in Computer Science | 2014-09-26 | Paper |
| Finding subsets of positive measure | 2014-08-08 | Paper |
Algorithmic aspects of Lipschitz functions
Computability | 2014-06-19 | Paper |
How much randomness is needed for statistics?
Annals of Pure and Applied Logic | 2014-06-06 | Paper |
Randomness extraction and asymptotic Hamming distance
Logical Methods in Computer Science | 2013-09-26 | Paper |
The probability distribution as a computational resource for randomness testing
Journal of Logic and Analysis | 2012-12-17 | Paper |
How much randomness is needed for statistics?
Lecture Notes in Computer Science | 2012-08-14 | Paper |
| Effective Banach spaces | 2012-07-27 | Paper |
Lowness notions, measure and domination
Journal of the London Mathematical Society. Second Series | 2012-06-08 | Paper |
Martin-Löf randomness and Galton-Watson processes
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
A strong law of computationally weak subsets
Journal of Mathematical Logic | 2011-10-24 | Paper |
Kolmogorov complexity and the recursion theorem
Transactions of the American Mathematical Society | 2011-10-17 | Paper |
Kolmogorov complexity and strong approximation of Brownian motion
Proceedings of the American Mathematical Society | 2011-10-11 | Paper |
Higher Kurtz randomness
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Superhighness
Notre Dame Journal of Formal Logic | 2010-09-02 | Paper |
The strength of the Besicovitch-Davies theorem
Programs, Proofs, Processes | 2010-07-29 | Paper |
Members of Random Closed Sets
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Numberings and randomness
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
The strength of the Grätzer-Schmidt theorem
Lecture Notes in Computer Science | 2010-07-28 | Paper |
Lattice initial segments of the hyperdegrees
Journal of Symbolic Logic | 2010-03-15 | Paper |
Self-embeddings of computable trees
Notre Dame Journal of Formal Logic | 2010-01-13 | Paper |
Infinite subsets of random sets of integers
Mathematical Research Letters | 2009-04-28 | Paper |
Finding paths through narrow and wide trees
Journal of Symbolic Logic | 2009-03-25 | Paper |
Effective dimension of points visited by Brownian motion
Theoretical Computer Science | 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
(available as arXiv preprint) | 2008-10-20 | Paper |
Kolmogorov complexity and the recursion theorem
Lecture Notes in Computer Science | 2008-03-19 | Paper |
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
Logical Foundations of Computer Science | 2008-01-04 | Paper |
Low for random reals and positive-measure domination
Proceedings of the American Mathematical Society | 2007-09-27 | Paper |
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
(available as arXiv preprint) | 2006-07-05 | Paper |
Lowness for the Class of Schnorr Random Reals
SIAM Journal on Computing | 2006-06-01 | Paper |
Comparing DNR and WWKL
Journal of Symbolic Logic | 2005-08-29 | Paper |
Local Initial Segments of The Turing Degrees
The Bulletin of Symbolic Logic | 2003-10-27 | Paper |
Local Initial Segments of The Turing Degrees
The Bulletin of Symbolic Logic | 2003-10-27 | Paper |
