| Publication | Date of Publication | Type |
|---|
Randomness versus superspeedability
(available as arXiv preprint) | N/A | Paper |
| Quasi-isometric reductions between infinite strings | 2026-05-12 | Paper |
| Randomness versus superspeedability | 2026-05-12 | Paper |
Quasi-isometric reductions between infinite strings
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Classifying different criteria for learning algebraic structures
Annals of Pure and Applied Logic | 2025-10-23 | Paper |
| Languages given by finite automata over the unary alphabet | 2025-07-28 | Paper |
Improved lower bounds for strong n-conjectures
Journal of the Australian Mathematical Society | 2025-07-08 | Paper |
Languages given by finite automata over the unary alphabet
Journal of Computer and System Sciences | 2025-03-26 | Paper |
| How to verify computations with a rational network | 2025-02-03 | Paper |
| A bisection approach to subcubic maximum induced matching | 2024-07-19 | Paper |
| Pumping, with or without choice | 2024-04-19 | Paper |
Learnability and positive equivalence relations
Information and Computation | 2024-02-02 | Paper |
Word automatic groups of nilpotency class 2
Information Processing Letters | 2023-10-12 | Paper |
Alternating automatic register machines
Lecture Notes in Computer Science | 2023-07-28 | Paper |
Addition machines, automatic functions and open problems of Floyd and Knuth
Journal of Computer and System Sciences | 2023-06-12 | Paper |
| Languages given by Finite Automata over the Unary Alphabet | 2023-02-13 | Paper |
| scientific article; zbMATH DE number 7650940 (Why is no real title available?) | 2023-02-07 | Paper |
| Measure and Conquer for Max Hamming Distance XSAT | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650314 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
String compression in FA-presentable structures
Theoretical Computer Science | 2023-02-01 | Paper |
On the classification of computable languages
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Lamplighter groups and automata
Acta Informatica | 2022-08-30 | Paper |
Random Subgroups of Rationals
(available as arXiv preprint) | 2022-07-21 | Paper |
Members of thin \(\Pi_1^0\) classes and generic degrees
Proceedings of the American Mathematical Society | 2022-06-15 | Paper |
A computation model with automatic functions and relations as primitive operations
Theoretical Computer Science | 2022-06-13 | Paper |
Deciding Parity Games in Quasi-polynomial Time
SIAM Journal on Computing | 2022-05-03 | Paper |
Learners based on transducers
Information and Computation | 2022-03-14 | Paper |
| An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs | 2022-01-10 | Paper |
Randomness and initial segment complexity for measures
Theoretical Computer Science | 2021-12-22 | Paper |
On the amount of nonconstructivity in learning formal languages from text
Information and Computation | 2021-11-25 | Paper |
Bi-immunity over different size alphabets
Theoretical Computer Science | 2021-11-11 | Paper |
Improved algorithms for the general exact satisfiability problem
Theoretical Computer Science | 2021-10-06 | Paper |
Learnability and positive equivalence relations
(available as arXiv preprint) | 2021-10-04 | Paper |
members of thin $\Pi_1^0$ classes and generic degrees
(available as arXiv preprint) | 2020-08-11 | Paper |
Closure of resource-bounded randomness notions under polynomial-time permutations
(available as arXiv preprint) | 2020-08-05 | Paper |
Ordered semiautomatic rings with applications to geometry
(available as arXiv preprint) | 2020-07-27 | Paper |
On the order dimension of locally countable partial orderings
Proceedings of the American Mathematical Society | 2020-05-27 | Paper |
Chaitin's \(\Omega\) as a continuous function
Journal of Symbolic Logic | 2020-04-17 | Paper |
Searching for shortest and least programs
Theoretical Computer Science | 2020-01-22 | Paper |
| Exact satisfiabitity with jokers | 2019-10-15 | Paper |
Reductions between types of numberings
Annals of Pure and Applied Logic | 2019-10-07 | Paper |
The isomorphism problem for tree-automatic ordinals with addition
Information Processing Letters | 2019-09-20 | Paper |
Randomness and initial segment complexity for probability measures
(available as arXiv preprint) | 2019-02-21 | Paper |
| On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference | 2019-02-06 | Paper |
The complexity of verbal languages over groups
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Measure, category and learning theory
Automata, Languages and Programming | 2019-01-10 | Paper |
| Automatic learning from repetitive texts | 2019-01-10 | Paper |
Depth, highness and DNR degrees
(available as arXiv preprint) | 2018-12-10 | Paper |
| Depth, highness and DNR degrees | 2018-12-10 | Paper |
| On the values for factor complexity | 2018-11-07 | Paper |
Implementing fragments of ZFC within an r.e. Universe
Journal Of Logic And Computation | 2018-09-28 | Paper |
Equivalences between learning of data and probability distributions, and their applications
Information and Computation | 2018-09-27 | Paper |
Finitely generated semiautomatic groups
Computability | 2018-09-20 | Paper |
Learning pattern languages over groups
Theoretical Computer Science | 2018-08-22 | Paper |
Learners based on transducers
Language and Automata Theory and Applications | 2018-06-26 | Paper |
Effectivity questions for Kleene's recursion theorem
Theoretical Computer Science | 2018-06-05 | Paper |
Randomness and Solovay degrees
Journal of Logic and Analysis | 2018-05-04 | Paper |
| Subrecursive Approximations of Irrational Numbers by Variable Base Sums | 2018-04-15 | Paper |
Limit-depth and DNR degrees
Information Processing Letters | 2018-04-05 | Paper |
Semiautomatic structures
Theory of Computing Systems | 2018-02-01 | Paper |
Regular patterns, regular languages and context-free languages
Information Processing Letters | 2017-11-03 | Paper |
Boolean algebras realized by c.e. equivalence relations
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
Deciding parity games in quasipolynomial time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Automatic learning from positive data and negative counterexamples
Information and Computation | 2017-08-08 | Paper |
Automatic linear orders and trees
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
A survey on recent results on partial learning
Proceedings of the 13th Asian Logic Conference | 2017-06-09 | Paper |
The complexity of verbal languages over groups
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Weakly represented families in reverse mathematics
Computability and Complexity | 2017-04-04 | Paper |
Closed left-r.e. sets
Computability | 2017-02-23 | Paper |
Covering the recursive sets
Annals of Pure and Applied Logic | 2017-02-08 | Paper |
| Inductive Inference and Reverse Mathematics | 2017-01-24 | Paper |
Priced learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Combining models of approximation with partial learning
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Enlarging learnable classes
Information and Computation | 2016-11-18 | Paper |
Learning pattern languages over groups
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Inductive inference and reverse mathematics
Annals of Pure and Applied Logic | 2016-10-10 | Paper |
Finitely generated semiautomatic groups
Pursuit of the Universal | 2016-08-17 | Paper |
On Martin’s pointed tree theorem
Computability | 2016-07-25 | Paper |
Tree-automatic scattered linear orders
Theoretical Computer Science | 2016-03-31 | Paper |
Finite state incompressible infinite sequences
Information and Computation | 2016-03-10 | Paper |
On the role of update constraints and text-types in iterative learning
Information and Computation | 2016-03-10 | Paper |
Learning automatic families of languages
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Partial learning of recursively enumerable languages
Theoretical Computer Science | 2016-02-26 | Paper |
Reducibilities among equivalence relations induced by recursively enumerable structures
Theoretical Computer Science | 2015-12-15 | Paper |
Effectivity questions for Kleene's recursion theorem
Logical Foundations of Computer Science | 2015-12-11 | Paper |
On block pumpable languages
Theoretical Computer Science | 2015-12-08 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Depth, highness and DNR degrees
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Graphs realised by r.e. equivalence relations
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
A reducibility related to being hyperimmune-free
Annals of Pure and Applied Logic | 2015-06-17 | Paper |
Cone avoidance and randomness preservation
Annals of Pure and Applied Logic | 2015-05-15 | Paper |
On the role of update constraints and text-types in iterative learning
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Confident and consistent partial learning of recursive functions
Theoretical Computer Science | 2014-10-31 | Paper |
Things that can be made into themselves
Information and Computation | 2014-07-18 | Paper |
Semiautomatic structures
Computer Science - Theory and Applications | 2014-06-24 | Paper |
The complexity of recursive splittings of random sets
Computability | 2014-06-19 | Paper |
Algorithmic aspects of Lipschitz functions
Computability | 2014-06-19 | Paper |
Finite State Incompressible Infinite Sequences
Lecture Notes in Computer Science | 2014-04-16 | 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 |
Robust learning of automatic classes of languages
Journal of Computer and System Sciences | 2014-02-13 | Paper |
