Analog computers and recursive functions over the reals. - Daniel Silva Graça; José Félix Costa (J. Complex., 2003)

Some recent developments on Shannon's General Purpose Analog Computer. - Daniel Silva Graça (Math. Log. Q., 2004)

Robust Simulations of Turing Machines with Analytic Maps and Flows. - Daniel Silva Graça; Manuel Lameiras Campagnolo; Jorge Buescu (CiE, 2005)

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. - Olivier Bournez; Manuel Lameiras Campagnolo; Daniel Silva Graça; Emmanuel Hainry (TAMC, 2006)

Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. - Daniel Silva Graça; Jorge Buescu; Manuel Lameiras Campagnolo (CCA, 2007)

Polynomial differential equations compute all real computable functions on computable compact intervals. - Olivier Bournez; Manuel Lameiras Campagnolo; Daniel Silva Graça; Emmanuel Hainry (J. Complex., 2007)

Computability with polynomial differential equations. - Daniel Silva Graça; Manuel Lameiras Campagnolo; Jorge Buescu (Adv. Appl. Math., 2008)

Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. - Pieter Collins; Daniel Silva Graça (CCA, 2008)

Computing Domains of Attraction for Planar Dynamics. - Daniel Silva Graça; Ning Zhong 002 (UC, 2009)

Computational bounds on polynomial differential equations. - Daniel Silva Graça; Jorge Buescu; Manuel Lameiras Campagnolo (Appl. Math. Comput., 2009)

Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. - Pieter Collins; Daniel Silva Graça (J. Univers. Comput. Sci., 2009)

Robust Computations with Dynamical Systems. - Olivier Bournez; Daniel Silva Graça; Emmanuel Hainry (MFCS, 2010)

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (MFCS, 2011)

Computability in planar dynamical systems. - Daniel Silva Graça; Ning Zhong 002 (Nat. Comput., 2011)

On the complexity of solving initial value problems. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (ISSAC, 2012)

Computability, noncomputability, and hyperbolic systems. - Daniel Silva Graça; Ning Zhong 002; Jorge Buescu (Appl. Math. Comput., 2012)

Noncomputability, unpredictability, and financial markets. - Daniel Silva Graça (Complex., 2012)

The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. - Daniel Silva Graça; Ning Zhong 002; H. S. Dumas (Theor. Comput. Sci., 2012)

Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly; Ning Zhong 002 (CiE, 2013)

Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (TAMC, 2013)

Computation with perturbed dynamical systems. - Olivier Bournez; Daniel Silva Graça; Emmanuel Hainry (J. Comput. Syst. Sci., 2013)

Computational complexity of solving elementary differential equations over unbounded domains. - Amaury Pouly; Daniel Silva Graça (CoRR, 2014)

Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (MACIS, 2015)

An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. - Daniel Silva Graça; Ning Zhong 002 (Theory Comput. Syst., 2015)

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. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (ICALP, 2016)

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (CoRR, 2016)

Computing with polynomial ordinary differential equations. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (J. Complex., 2016)

Computational complexity of solving polynomial differential equations over unbounded domains. - Amaury Pouly; Daniel Silva Graça (Theor. Comput. Sci., 2016)

Computing geometric Lorenz attractors with arbitrary precision. - Daniel Silva Graça; Cristobal Rojas; Ning Zhong 002 (CoRR, 2017)

On the functions generated by the general purpose analog computer. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (Inf. Comput., 2017)

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. - Olivier Bournez; Daniel Silva Graça; Amaury Pouly (J. ACM, 2017)

Computability of Ordinary Differential Equations. - Daniel Silva Graça; Ning Zhong 002 (CiE, 2018)

Computability of Limit Sets for Two-Dimensional Flows. - Daniel Silva Graça; Ning Zhong 002 (CiE, 2021)

Computing the exact number of periodic orbits for planar flows. - Daniel Silva Graça; Ning Zhong 002 (CoRR, 2021)

Robustness of non-computability. - Daniel Silva Graça; Ning Zhong 002 (CoRR, 2021)

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. - Daniel Silva Graça; Ning Zhong 002 (Theor. Comput. Sci., 2021)

Characterizing time computational complexity classes with polynomial differential equations. - Riccardo Gozzi; Daniel Graça 001 (Comput., 2023)

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. - Daniel Silva Graça; Ning Zhong 002 (Comput., 2023)

Robust non-computability and stability of dynamical systems. - Daniel Silva Graça; Ning Zhong (CoRR, 2023)

A continuous characterization of PSPACE using polynomial ordinary differential equations. - Olivier Bournez; Riccardo Gozzi; Daniel Silva Graça; Amaury Pouly (J. Complex., 2023)

Robust non-computability of dynamical systems and computability of robust dynamical systems. - Daniel Silva Graça; Ning Zhong (Log. Methods Comput. Sci., 2024)

Computation with Real Numbers and Continuous-Time Dynamical Systems. - Daniel Silva Graça (CiE, 2025)