2024
Word automatic groups of nilpotency class 2.
Inf. Process. Lett., January, 2024
2023
Maximal Towers and Ultrafilter Bases in Computability Theory.
J. Symb. Log., 2023
2022
Randomness and initial segment complexity for measures.
Theor. Comput. Sci., 2022
Coarse groups, and the isomorphism problem for oligomorphic groups.
J. Math. Log., 2022
2021
The Reverse Mathematics of theorems of Jordan and Lebesgue.
J. Symb. Log., 2021
Muchnik Degrees and cardinal characteristics.
J. Symb. Log., 2021
FraïSSé Limits for Relational Metric Structures.
J. Symb. Log., 2021
2020
Randomness Notions and Reverse Mathematics.
J. Symb. Log., 2020
Computing from projections of random points.
J. Math. Log., 2020
Randomness and Initial Segment Complexity for Probability Measures.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
2019
Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets.
Notre Dame J. Formal Log., 2019
2018
Calibrating word problems of groups via the complexity of equivalence relations.
Math. Struct. Comput. Sci., 2018
The Complexity of Topological Group Isomorphism.
J. Symb. Log., 2018
Randomness and Solovay degrees.
J. Log. Anal., 2018
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
From Eventually Different Functions to Pandemic Numberings.
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Lowness, Randomness, and Computable Analysis.
Proceedings of the Computability and Complexity, 2017
Calculus of Cost Functions.
Proceedings of the Incomputable: Journeys Beyond the Turing Barrier, 2017
2016
Using Almost-everywhere theorems from Analysis to Study Randomness.
Bull. Symb. Log., 2016
A Computational Approach to the Borwein-Ditor Theorem.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016
Lightface Π<sub>3</sub><sup>0</sup>-Completeness of Density Sets Under Effective Wadge Reducibility.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016
2015
Feasible Analysis, Randomness, and Base Invariance.
Theory Comput. Syst., 2015
Counting the changes of random Δ20 sets.
J. Log. Comput., 2015
Solovay functions and their applications in algorithmic randomness.
J. Comput. Syst. Sci., 2015
Demuth's Path to Randomness.
Bull. Symb. Log., 2015
A Unifying Approach to the Gamma Question.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
Local Compactness for Computable Polish Metric Spaces is \varPi ^1_1 Π 1 1 -complete.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015
2014
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10).
NII Shonan Meet. Rep., 2014
Complexity of Equivalence Relations and Preorders from Computability Theory.
J. Symb. Log., 2014
Characterizing Lowness for Demuth Randomness.
J. Symb. Log., 2014
Denjoy, Demuth and density.
J. Math. Log., 2014
The Complexity of Recursive Splittings of Random Sets.
Comput., 2014
Algorithmic Aspects of Lipschitz Functions.
Comput., 2014
Computing k-Trivial Sets by Incomplete Random Sets.
Bull. Symb. Log., 2014
Differentiability of polynomial time computable functions.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
2013
Joining non-low C.E. sets with diagonally non-computable functions.
J. Log. Comput., 2013
The Classification Problem for Compact Computable Metric Spaces.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
Low upper bounds in the Turing degrees revisited.
J. Log. Comput., 2012
Computably enumerable sets below random sets.
Ann. Pure Appl. Log., 2012
Equivalence Relations That Are Σ<sup>0</sup><sub>3</sub> Complete for Computable Reducibility - (Extended Abstract).
Proceedings of the Logic, Language, Information and Computation, 2012
The Denjoy alternative for computable functions.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Demuth's Path to Randomness.
Proceedings of the Computation, Physics and Beyond, 2012
2011
Universal recursively enumerable sets of strings.
Theor. Comput. Sci., 2011
Borel structures and Borel theories.
J. Symb. Log., 2011
Benign cost functions and lowness properties.
J. Symb. Log., 2011
Randomness and Differentiability.
CoRR, 2011
Demuth randomness and computational complexity.
Ann. Pure Appl. Log., 2011
Upper bounds on ideals in the computably enumerable Turing degrees.
Ann. Pure Appl. Log., 2011
Solovay functions and K-triviality.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
2010
Ann. Pure Appl. Log., 2010
Counting the Changes of Random D<sup>0</sup><sub>2</sub> Sets.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010
2009
Notre Dame J. Formal Log., 2009
Finite automata presentable abelian groups.
Ann. Pure Appl. Log., 2009
Superhighness and Strong Jump Traceability.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
The First Order Theories of the Medvedev and Muchnik Lattices.
Proceedings of the Mathematical Theory and Computational Practice, 2009
2008
From Automatic Structures to Borel Structures.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
2007
Automatic Structures: Richness and Limitations.
Log. Methods Comput. Sci., 2007
A Weakly 2-Random Set That Is Not Generalized Low.
Proceedings of the Computation and Logic in the Real World, 2007
2006
Lowness and Π<sub>2</sub><sup>0</sup> nullsets.
J. Symb. Log., 2006
Randomness and Computability: Open Questions.
Bull. Symb. Log., 2006
Kolmogorov-Loveland randomness and stochasticity.
Ann. Pure Appl. Log., 2006
2005
Lowness for the Class of Schnorr Random Reals.
SIAM J. Comput., 2005
Program Size Complexity for Possibly Infinite Computations.
Notre Dame J. Formal Log., 2005
Randomness, relativization and Turing degrees.
J. Symb. Log., 2005
Relativizing Chaitin's Halting Probability.
J. Math. Log., 2005
Lowness Properties and Approximations of the Jump.
Proceedings of the 12th Workshop on Logic, Language, Information and Computation, 2005
2003
Parameter Definability in the Recursively Enumerable Degrees.
J. Math. Log., 2003
Separating Classes of Groups by First-Order Sentences.
Int. J. Algebra Comput., 2003
Lowness Properties of Reals and Hyper-Immunity.
Proceedings of the 10th Workshop on Logic, Language, Information and Computation, 2003
2002
Randomness, Computability, and Density.
SIAM J. Comput., 2002
Proceedings of the Computability and Complexity in Analysis, 2002
2001
Initial Segments of The Lattice of PI<sup>0</sup><sub>1</sub> Classes.
J. Symb. Log., 2001
Interpreting N in the computably enumerable weak truth talble degrees.
Ann. Pure Appl. Log., 2001
On the filter of computably enumerable supersets of an r-maximal set.
Arch. Math. Log., 2001
2000
Differences of Computably Enumerable Sets.
Math. Log. Q., 2000
Structural Properties and Sigma<sup>0</sup><sub>2</sub> Enumeration Degrees.
J. Symb. Log., 2000
Undecidability Results for Low Complexity Time Classes.
J. Comput. Syst. Sci., 2000
Model theory of the computably enumerable many-one degrees.
Log. J. IGPL, 2000
1999
A New Spectrum of Recursive Models.
Notre Dame J. Formal Log., 1999
Addendum to "Computably Enumerable Sets and Quasi-Reducibility".
Ann. Pure Appl. Log., 1999
1998
Computably Enumerable Sets and Quasi-Reducibility.
Ann. Pure Appl. Log., 1998
1997
Computable Models of Theories with Few Models.
Notre Dame J. Formal Log., 1997
Chaitin Omega Numbers and Strong Reducibilities.
J. Univers. Comput. Sci., 1997
Undecidability Results for Low Complexity Degree Structures.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
Definability in the recursively enumerable degrees.
Bull. Symb. Log., 1996
1995
The Undecidability of the Pi<sub>4</sub>-Theory for the R. E. WTT and Turing Degrees.
J. Symb. Log., 1995
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees.
Ann. Pure Appl. Log., 1995
Noninterpretability of Infinite Linear Orders.
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995
1994
Recursively Enumerable Equivalence Relations Modulo Finite Differences.
Math. Log. Q., 1994
1993
Interpreting True Arithmetic in Degree Structures.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993
1992
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability.
J. Symb. Log., 1992
Cappable recursively enumerable degrees and Post's program.
Arch. Math. Log., 1992
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable.
Proceedings of the STACS 92, 1992
