Daniel Silva Graça

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 21

Top Topics

Differential Equations

Dynamical Systems

Numerical Integration

Top Venues

Theor. Comput. Sci.

Publications

Daniel Silva Graça, Ning Zhong
Robust non-computability of dynamical systems and computability of robust dynamical systems. Log. Methods Comput. Sci. 20 (2) (2024)
Daniel Silva Graça, Ning Zhong
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. Comput. 12 (2) (2023)
Daniel Silva Graça, Ning Zhong
Robust non-computability and stability of dynamical systems. CoRR (2023)
Olivier Bournez, Riccardo Gozzi, Daniel Silva Graça, Amaury Pouly
A continuous characterization of PSPACE using polynomial ordinary differential equations. J. Complex. 77 (2023)
Daniel Silva Graça, Ning Zhong
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. Theor. Comput. Sci. 895 (2021)
Daniel Silva Graça, Ning Zhong
Computing the exact number of periodic orbits for planar flows. CoRR (2021)
Daniel Silva Graça, Ning Zhong
Computability of Limit Sets for Two-Dimensional Flows. CiE (2021)
Daniel Silva Graça, Ning Zhong
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines. CoRR (2021)
Daniel Silva Graça, Ning Zhong
Robustness of non-computability. CoRR (2021)
Daniel Silva Graça, Ning Zhong
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable. CoRR (2020)
Daniel Silva Graça, Ning Zhong
Computability of Ordinary Differential Equations. CiE (2018)
Daniel Silva Graça, Cristobal Rojas, Ning Zhong
Computing geometric Lorenz attractors with arbitrary precision. CoRR (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the functions generated by the general purpose analog computer. Inf. Comput. 257 (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. J. ACM 64 (6) (2017)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with polynomial ordinary differential equations. J. Complex. 36 (2016)
Amaury Pouly, Daniel Silva Graça
Computational complexity of solving polynomial differential equations over unbounded domains. Theor. Comput. Sci. 626 (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the Functions Generated by the General Purpose Analog Computer. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
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. ICALP (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Computing with Polynomial Ordinary Differential Equations. CoRR (2016)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. MACIS (2015)
Daniel Silva Graça, Ning Zhong
An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable. Theory Comput. Syst. 57 (2) (2015)
Amaury Pouly, Daniel Silva Graça
Computational complexity of solving elementary differential equations over unbounded domains. CoRR (2014)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Computation with perturbed dynamical systems. J. Comput. Syst. Sci. 79 (5) (2013)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems. CiE (2013)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. TAMC (2013)
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Turing machines can be efficiently simulated by the General Purpose Analog Computer. CoRR (2012)
Daniel Silva Graça, Ning Zhong, H. S. Dumas
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. Theor. Comput. Sci. 457 (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems CoRR (2012)
Daniel Silva Graça, Ning Zhong, Jorge Buescu
Computability, noncomputability, and hyperbolic systems. Appl. Math. Comput. 219 (6) (2012)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
On the complexity of solving initial value problems. ISSAC (2012)
Daniel Silva Graça
Noncomputability, unpredictability, and financial markets. Complex. 17 (6) (2012)
Daniel Silva Graça, Ning Zhong
Computability in planar dynamical systems. Nat. Comput. 10 (4) (2011)
Olivier Bournez, Daniel Silva Graça, Amaury Pouly
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS (2011)
Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry
Robust Computations with Dynamical Systems. MFCS (2010)
Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo
Computational bounds on polynomial differential equations. Appl. Math. Comput. 215 (4) (2009)
Daniel Silva Graça, Ning Zhong
Computing Domains of Attraction for Planar Dynamics. UC (2009)
Pieter Collins, Daniel Silva Graça
Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach. J. Univers. Comput. Sci. 15 (6) (2009)
Pieter Collins, Daniel Silva Graça
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. Electron. Notes Theor. Comput. Sci. 221 (2008)
Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu
Computability with polynomial differential equations. Adv. Appl. Math. 40 (3) (2008)
Daniel Silva Graça, Jorge Buescu, Manuel Lameiras Campagnolo
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs. Electron. Notes Theor. Comput. Sci. 202 (2008)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
Polynomial differential equations compute all real computable functions on computable compact intervals. J. Complex. 23 (3) (2007)
Olivier Bournez, Manuel Lameiras Campagnolo, Daniel Silva Graça, Emmanuel Hainry
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation. TAMC (2006)
Daniel Silva Graça, Manuel Lameiras Campagnolo, Jorge Buescu
Robust Simulations of Turing Machines with Analytic Maps and Flows. CiE (2005)
Daniel Silva Graça
Some recent developments on Shannon's General Purpose Analog Computer. Math. Log. Q. 50 (4-5) (2004)
Daniel Silva Graça, José Félix Costa
Analog computers and recursive functions over the reals. J. Complex. 19 (5) (2003)