ConTComp: publications 2004-2007
BOOK CHAPTERS:
- O. Bournez
and M. L. Campagnolo, A survey on continuous time computations, in
Cooper,
S.B.; Löwe, Benedikt; Sorbi, Andrea (Eds.), New Computational
Paradigms:
Changing Conceptions of What is Computable,
Springer, to appear (accepted in May 2007)
-
D. S.
Graça, J. Buescu and M. L.
Campagnolo, Boundedness of the domain of definition is undecidable for
polynomial ODEs, Proceedings of the 4th International Conference on
Computability and Complexity in Analysis (CCA 2007),
R. Dillhage and T. Grubba and A. Sorbi and K. Weihrauch
and N. Zhong (Edts), FernUniversität in Hagen, 2007
pages 127--135.
- C. Lourenço, How can natural brains help us compute?, in Cooper, S.B., Löwe,
B., and Sorbi, A. eds., Computation and Logic in the Real World, (CiE 2007),
in the series Quaderni del Dipartimento di Scienze Matematiche e
Informatiche "Roberto Magari", pages 257--262, Universita di Siena, 2007.
- C. Lourenço, Structured
reservoir computing with spatiotemporal chaotic
attractors, in Verleysen, M. ed., 15th European Symposium on Artificial Neural
Networks (ESANN 2007), pages 501--506, 2007.
- D. S.
Graça, N. Zhong, and J. Buescu.
The ordinary differential equation defined by a computable function
whose
maximal interval of existence is non-computable. In G. Hanrot and
P. Zimmermann, editors, Proceedings of the 7th Conference on
Real
Numbers and Computers (RNC 7), pages 33--40. LORIA/INRIA, 2006.
- C. Lourenço.
Dynamical reservoir properties as
network effects. In M. Verleysen, editor, Proceedings of the
14th
European Symposium on Artificial Neural Networks (ESANN'06), pages
503--508. d-side, 2006.
- C. Lourenço.
A very small chaotic neural net. In Proceedings
of the 2006 International Joint Conference on Neural Networks
(IJCNN'06) at the
2006 IEEE World Congress on Computational Intelligence, pages
8341--8344.
IEEE, 2006.
- M. Alves
and
C. Lourenço. Selenoprotein discovery using neural networks.
In
N. Guimarães and P. Isaías, editors, Proceedings
of the
International Conference on Applied Computing (IADIS'05), pages
519--526, Algarve, Portugal,
February 22-25, 2005.
- D. S. Graça, Computability via analog
circuits. In
V. Brattka, M. Schröder, K. Weihrauch, and
N. Zhong, editors, Procs. International Conference on
Computability and
Complexity in Analysis, pages 229--240. FernUniversität in Hagen, 2003.
ARTICLES IN INTERNATIONAL JOURNALS:
- M. L. Campagnolo and K. Ojakian. Using Approximation to
Relate Computational Classes over the Reals. In
J. Durand-Lose and M. Margenstern (Eds.): MCU 2007,
volume 4664 of Lecture
Notes in Computer Science, pages 39--61. Springer-Verlag, 2007.
- M. L.
Campagnolo and K. Ojakian. The elementary
computable functions over the real numbers: Applying two new
techniques. Archives for
Mathematical Logic, to appear (accepted in June 2007)
- D. S.
Graça, M. L.
Campagnolo, and J. Buescu. Computability with
polynomial differential equations. Advances in Applied Mathematics,
in
print, http://dx.doi.org/10.1016/j.aam.2007.02.003 (accepted in April 2007)
- D. S.
Graça,
N. Zhong, and J. Buescu. Computability, noncomputability and
undecidability of maximal intervals of IVPs. Transactions of the
American
Mathematical Society, in print. (accepted in May 2006)
- O. Bournez,
M. L. Campagnolo,
D. S. Graça, and E. Hainry. Polynomial
differential equations compute all real computable functions on
computable
compact intervals, Journal of Complexity, 23 (3), 2007, 317--335.
- C. Lourenço, Dynamical
computation reservoir emerging within a biological network, Neurocomputing,
Vol. 70, 1177-1185, 2007.
- M. L.
Campagnolo and K. Ojakian. The
methods of approximation and lifting in real computation, Electronic
Notes in Theoretical Computer Science, 167:387--423, 2007.
- O. Bournez,
M. L. Campagnolo, D. S. Graça,
and E. Hainry. The General
Purpose Analog Computer and Computable Analysis are two equivalent
paradigms of
analog computation. In J.-Y. Cai, S. B. Cooper, and A. Li,
editors, Theory
and Applications of Models of Computation TAMC'06, volume 3959 of Lecture
Notes in Computer Science, pages 631--643. Springer-Verlag, 2006.
- D. S.
Graça, M. L. Campagnolo, and J. Buescu.
Robust simulations of Turing
machines with analytic maps and flows. In
B. Cooper, B. Löwe, and L. Torenvliet, editors, Proceedings
of CiE'05, New Computational Paradigms, volume 3526 of Lecture
Notes in
Computer Science, pages 169--179. Springer-Verlag, 2005.
- M. L.
Campagnolo. Continuous time computation
with restricted integration capabilities. Theoretical Computer
Science,
317:147--165, 2004.
- D. S. Graça. Some recent developments on Shannon's
General Purpose Analog Computer. Mathematical Logic Quarterly,
50(4-5):473--485, 2004.
- C. Lourenço.
Attention-locked computation with chaotic neural nets. International
Journal
of Bifurcation and Chaos, 14(2):737--760, 2004.
PhD DISSERTATION:
D. S. Graça. Computability with Polynomial
Differential Equations. PhD thesis, IST,
Universidade Técnica de Lisboa, 2007. Awaiting
examination. Supervised by M. Campagnolo and J. Buescu.