| Publication | Date of Publication | Type |
|---|
| Robust non-computability of dynamical systems and computability of robust dynamical systems | 2024-09-04 | Paper |
| Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines | 2023-09-13 | Paper |
| A continuous characterization of PSPACE using polynomial ordinary differential equations | 2023-06-07 | Paper |
| Characterizing time computational complexity classes with polynomial differential equations | 2023-03-09 | Paper |
| Computing the exact number of periodic orbits for planar flows | 2022-08-29 | Paper |
| Computability of limit sets for two-dimensional flows | 2022-03-22 | Paper |
| Computability of Differential Equations | 2022-01-26 | Paper |
| The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable | 2021-11-18 | Paper |
| Robustness of non-computability | 2021-09-30 | Paper |
| The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable | 2020-02-19 | Paper |
| Computability of ordinary differential equations | 2018-09-06 | Paper |
| Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length | 2018-05-17 | Paper |
| Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations | 2017-12-19 | Paper |
| On the functions generated by the general purpose analog computer | 2017-11-16 | Paper |
| Computing geometric Lorenz attractors with arbitrary precision | 2017-02-13 | Paper |
| Computing with polynomial ordinary differential equations | 2016-09-01 | Paper |
| Rigorous numerical computation of polynomial differential equations over unbounded domains | 2016-05-25 | Paper |
| Computational complexity of solving polynomial differential equations over unbounded domains | 2016-03-31 | Paper |
| An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable | 2016-01-28 | Paper |
| On the complexity of solving initial value problems | 2015-03-27 | Paper |
| Computability, noncomputability, and hyperbolic systems | 2015-03-26 | Paper |
| Computability and computational complexity of the evolution of nonlinear dynamical systems | 2013-08-05 | Paper |
| Computation with perturbed dynamical systems | 2013-07-24 | Paper |
| Turing machines can be efficiently simulated by the general purpose analog computer | 2013-05-28 | Paper |
| Boundedness of the domain of definition is undecidable for polynomial ODEs | 2013-05-03 | Paper |
| Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach | 2013-05-03 | Paper |
| Computability in planar dynamical systems | 2012-11-15 | Paper |
| The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited | 2012-10-11 | Paper |
| Computability and dynamical systems | 2012-09-05 | Paper |
| Solving analytic differential equations in polynomial time over unbounded domains | 2011-08-17 | Paper |
| Robust Computations with Dynamical Systems | 2010-09-03 | Paper |
| Computational bounds on polynomial differential equations | 2009-11-13 | Paper |
| Effective computability of solutions of differential inclusions: the ten thousand monkeys approach | 2009-10-28 | Paper |
| Computing Domains of Attraction for Planar Dynamics | 2009-10-22 | Paper |
| Computability, noncomputability and undecidability of maximal intervals of IVPs | 2009-05-27 | Paper |
| Computability with polynomial differential equations | 2008-04-28 | Paper |
| Polynomial differential equations compute all real computable functions on computable compact intervals | 2007-07-04 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Some recent developments on Shannon's General Purpose Analog Computer | 2005-02-16 | Paper |
| Analog computers and recursive functions over the reals. | 2004-03-14 | Paper |
| Robust non-computability and stability of dynamical systems | N/A | Paper |
