| Publication | Date of Publication | Type |
|---|
| On the algorithmic descriptive complexity of attractors in topological dynamics | 2023-11-26 | Paper |
| Find a witness or shatter: the landscape of computable PAC learning | 2023-02-05 | Paper |
Realizing semicomputable simplices by computable dynamical systems
Theoretical Computer Science | 2022-09-27 | Paper |
Computability in harmonic analysis
Foundations of Computational Mathematics | 2022-06-03 | Paper |
Computable Geometric Complex Analysis and Complex Dynamics
Theory and Applications of Computability | 2022-01-26 | Paper |
Real quadratic Julia sets can have arbitrarily high complexity
Foundations of Computational Mathematics | 2021-03-23 | Paper |
| scientific article; zbMATH DE number 7311149 (Why is no real title available?) | 2021-02-16 | Paper |
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Computability in Harmonic Analysis
(available as arXiv preprint) | 2020-11-19 | Paper |
Computability on quasi-Polish spaces
(available as arXiv preprint) | 2020-05-12 | Paper |
Computability of topological entropy: from general systems to transformations on Cantor sets and the interval
Discrete and Continuous Dynamical Systems | 2020-05-05 | Paper |
Carathéodory convergence and harmonic measure
Potential Analysis | 2019-11-27 | Paper |
How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable
(available as arXiv preprint) | 2019-10-21 | Paper |
| On the computability properties of topological entropy: a general approach | 2019-06-04 | Paper |
Computational intractability of attractors in the real quadratic family
Advances in Mathematics | 2019-05-29 | Paper |
Real quadratic Julia sets can have arbitrarily high complexity
(available as arXiv preprint) | 2019-04-11 | Paper |
Non computable Mandelbrot-like sets for a one-parameter complex family
Information and Computation | 2018-09-27 | Paper |
Tight space-noise tradeoffs in computing the ergodic measure
Sbornik: Mathematics | 2018-04-06 | Paper |
On the information carried by programs about the objects they compute
Theory of Computing Systems | 2018-02-01 | Paper |
Computable geometric complex analysis and complex dynamics
(available as arXiv preprint) | 2017-03-19 | Paper |
On the information carried by programs about the objects they compute
(available as arXiv preprint) | 2017-01-24 | Paper |
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Probability, statistics and computation in dynamical systems
Mathematical Structures in Computer Science | 2016-07-26 | Paper |
Non-computable impressions of computable external rays of quadratic polynomials
Communications in Mathematical Physics | 2015-03-31 | Paper |
Computable Carathéodory theory
Advances in Mathematics | 2014-09-08 | Paper |
Algorithmic tests and randomness with respect to a class of measures
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
Schnorr randomness and the Lebesgue differentiation theorem
Proceedings of the American Mathematical Society | 2013-11-14 | Paper |
Statistical properties of dynamical systems -- Simulation and abstract computation
Chaos, Solitons and Fractals | 2013-08-07 | Paper |
Computability of the Radon-Nikodym derivative
Computability | 2013-01-30 | Paper |
| Randomness on computable probability spaces -- a dynamical point of view | 2012-04-24 | Paper |
Computability of Brolin-Lyubich measure
Communications in Mathematical Physics | 2011-12-13 | Paper |
Computability of the Radon-Nikodym derivative
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Randomness on computable probability spaces -- a dynamical point of view
Theory of Computing Systems | 2011-05-23 | Paper |
Coding discretizations of continuous functions
Discrete Mathematics | 2011-05-06 | Paper |
Dynamics and abstract computability: computing invariant measures
Discrete and Continuous Dynamical Systems | 2011-03-07 | Paper |
An application of Martin-Löf randomness to effective probability theory
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation | 2010-01-12 | Paper |
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation | 2009-07-15 | Paper |
Applications of Effective Probability Theory to Martin-Löf Randomness
Automata, Languages and Programming | 2009-07-14 | Paper |
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Theoretical Computer Science | 2009-05-28 | Paper |
Computability and information in models of randomness and chaos
Mathematical Structures in Computer Science | 2008-04-10 | Paper |
Computability of probability measures and Martin-Lof randomness over metric spaces
(available as arXiv preprint) | 2007-09-06 | Paper |
Effective dynamical systems beyond dimension zero and factors of SFTs
(available as arXiv preprint) | N/A | Paper |
