Seuraa
Daniel S. Graça
Daniel S. Graça
Vahvistettu sähköpostiosoite verkkotunnuksessa ualg.pt - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Analog computers and recursive functions over the reals
DS Graça, JF Costa
Journal of Complexity 19 (5), 644-664, 2003
1662003
Polynomial differential equations compute all real computable functions on computable compact intervals
O Bournez, ML Campagnolo, DS Graça, E Hainry
Journal of Complexity 23 (3), 317-335, 2007
1112007
Computability with polynomial differential equations
DS Graça, ML Campagnolo, J Buescu
Advances in Applied Mathematics 40 (3), 330-349, 2008
1002008
Some recent developments on Shannon's general purpose analog computer
D Silva Graça
Mathematical Logic Quarterly: Mathematical Logic Quarterly 50 (4‐5), 473-485, 2004
862004
The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation
O Bournez, ML Campagnolo, DS Graça, E Hainry
International Conference on Theory and Applications of Models of Computation …, 2006
682006
Computability, noncomputability and undecidability of maximal intervals of IVPs
DS Graça, N Zhong, J Buescu
Transactions of the American Mathematical Society 361 (6), 2913-2927, 2009
572009
Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length
O Bournez, DS Graça, A Pouly
Journal of the ACM (JACM) 64 (6), 1-76, 2017
562017
Robust simulations of Turing machines with analytic maps and flows
DS Graça, ML Campagnolo, J Buescu
New Computational Paradigms: First Conference on Computability in Europe …, 2005
562005
Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach.
P Collins, DS Graça
J. Univers. Comput. Sci. 15 (6), 1162-1185, 2009
372009
Computational complexity of solving polynomial differential equations over unbounded domains
A Pouly, DS Graça
Theoretical Computer Science 626, 67-82, 2016
272016
Boundedness of the domain of definition is undecidable for polynomial ODEs
DS Graça, J Buescu, ML Campagnolo
Electronic Notes in Theoretical Computer Science 202, 49-57, 2008
272008
Effective computability of solutions of ordinary differential equations the thousand monkeys approach
P Collins, DS Graça
Electronic Notes in Theoretical Computer Science 221, 103-114, 2008
262008
On the complexity of solving initial value problems
O Bournez, DS Graça, A Pouly
Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012
202012
The general purpose analog computer and recursive functions over the reals
D Graça
PQDT-Global, 2002
202002
Solving analytic differential equations in polynomial time over unbounded domains
O Bournez, DS Graça, A Pouly
Mathematical Foundations of Computer Science 2011: 36th International …, 2011
192011
On the functions generated by the general purpose analog computer
O Bournez, D Graça, A Pouly
Information and Computation 257, 34-57, 2017
182017
Computational bounds on polynomial differential equations
DS Graça, J Buescu, ML Campagnolo
Applied mathematics and computation 215 (4), 1375-1385, 2009
152009
Computation with perturbed dynamical systems
O Bournez, DS Graça, E Hainry
Journal of Computer and System Sciences 79 (5), 714-724, 2013
142013
Computing geometric Lorenz attractors with arbitrary precision
D Graça, C Rojas, N Zhong
Transactions of the American Mathematical Society 370 (4), 2955-2970, 2018
122018
Computing with polynomial ordinary differential equations
O Bournez, D Graça, A Pouly
Journal of Complexity 36, 106-140, 2016
112016
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20