| Publication | Date of Publication | Type |
|---|
On representations of irrational numbers and the computational complexity of converting between such representations
The Bulletin of Symbolic Logic | 2025-12-30 | Paper |
Agafonov's theorem for finite and infinite alphabets and probability distributions different from equidistribution
Ergodic Theory and Dynamical Systems | 2025-10-14 | Paper |
Implicit representation of relations
Theory of Computing Systems | 2024-01-08 | Paper |
A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
Journal of Economic Theory | 2023-11-17 | Paper |
Read/write factorizable programs
Journal of Functional Programming | 2023-08-09 | Paper |
Subclasses of \textsc{Ptime} interpreted by programming languages
Theory of Computing Systems | 2023-07-26 | Paper |
| The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting. | 2023-06-23 | Paper |
| On representations of real numbers and the computational complexity of converting between such representations | 2023-04-14 | Paper |
| Liouville numbers and the computational complexity of changing bases | 2022-12-16 | Paper |
| On the complexity of conversion between classic real number representations | 2022-12-16 | Paper |
| Subrecursive equivalence relations and (non-)closure under lattice operations | 2022-03-22 | Paper |
| scientific article; zbMATH DE number 7453191 (Why is no real title available?) | 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453191 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
| Agafonov's Proof of Agafonov's Theorem: A Modern Account and New Insights | 2020-07-07 | Paper |
| Term rewriting systems as topological dynamical systems | 2020-05-27 | Paper |
| More intensional versions of Rice's theorem | 2020-05-12 | Paper |
The fixed point property and a technique to harness double fixed point combinators
Journal Of Logic And Computation | 2020-02-03 | Paper |
Computing with Infinite Terms and Infinite Reductions
Fundamenta Informaticae | 2020-01-22 | Paper |
| Programming in biomolecular computation: programs, self-interpretation and visualisation | 2019-02-08 | Paper |
Chains, antichains, and complements in infinite partition lattices
Algebra Universalis | 2018-07-16 | Paper |
Chains, antichains, and complements in infinite partition lattices
Algebra Universalis | 2018-07-16 | Paper |
Near optimal adjacency labeling schemes for power-law graphs
(available as arXiv preprint) | 2017-12-19 | Paper |
Complexity hierarchies and higher-order cons-free rewriting
(available as arXiv preprint) | 2017-10-17 | Paper |
Complexity hierarchies and higher-order cons-free term rewriting
(available as arXiv preprint) | 2017-10-12 | Paper |
Brief announcement: Labeling schemes for power-law graphs
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Computing continuous-time Markov chains as transformers of unbounded observables
Lecture Notes in Computer Science | 2017-05-19 | Paper |
The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
Programming Languages and Systems | 2017-05-19 | Paper |
Some remarks on real numbers induced by first-order spectra
Notre Dame Journal of Formal Logic | 2016-09-01 | Paper |
Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and \(\lambda\)-calculus
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
A confluent rewriting system having no computable, one-step, normalizing strategy
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Programs=data=first-class citizens in a computational world
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
Chains, Antichains, and Complements in Infinite Partition Lattices
(available as arXiv preprint) | 2015-01-21 | Paper |
An implicit characterization of the polynomial-time decidable sets by cons-free rewriting
Lecture Notes in Computer Science | 2014-07-24 | Paper |
scientific article; zbMATH DE number 6292628 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Programming in biomolecular computation
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
An experimental investigation of the normality of irrational algebraic numbers
Mathematics of Computation | 2013-07-23 | Paper |
Characterizing languages by normalization and termination in string rewriting (extended abstract)
Developments in Language Theory | 2012-11-02 | Paper |
| The exact hardness of deciding derivational and runtime complexity | 2012-09-18 | Paper |
| scientific article; zbMATH DE number 6027889 (Why is no real title available?) | 2012-04-25 | Paper |
| Weak Convergence and Uniform Normalization in Infinitary Rewriting | 2012-04-25 | Paper |
| Anagopos: a reduction graph visualizer for term rewriting and lambda calculus | 2012-04-24 | Paper |
Infinitary combinatory reduction systems
Information and Computation | 2011-07-08 | Paper |
Beta-shifts, their languages, and computability
Theory of Computing Systems | 2011-03-30 | Paper |
Levels of undecidability in rewriting
Information and Computation | 2011-02-21 | Paper |
Infinitary combinatory reduction systems: normalising reduction strategies
Logical Methods in Computer Science | 2010-07-27 | Paper |
Least upper bounds on the size of Church-Rosser diagrams in term rewriting and \(\lambda \)-calculus
Functional and Logic Programming | 2010-05-04 | Paper |
Infinitary combinatory reduction systems: confluence
Logical Methods in Computer Science | 2010-01-28 | Paper |
On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
Theoretical Computer Science | 2009-11-06 | Paper |
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters | 2009-07-21 | Paper |
POETS: process-oriented event-driven transaction systems
The Journal of Logic and Algebraic Programming | 2009-07-20 | Paper |
The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Rewriting Techniques and Applications
Lecture Notes in Computer Science | 2009-04-30 | Paper |
| On the computability of the topological entropy of subshifts | 2008-05-27 | Paper |
On Confluence of Infinitary Combinatory Reduction Systems
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On local non‐compactness in recursive mathematics
Mathematical Logic Quarterly | 2006-08-30 | Paper |
On modularity in infinitary term rewriting
Information and Computation | 2006-07-12 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Specker sequences revisited
Mathematical Logic Quarterly | 2005-09-26 | Paper |
