A Survey on Continuous Time Computations

2009/07/17 by Olivier Bournez, Manuel Campagnolo · 1 voice · 1 citation
Computer Science · #cs.CC

paper · pdf

published as New Computational Paradigms. Changing Conceptions of What is Computable. (Cooper, S.B. and L{ö}we, B. and Sorbi, A., Eds.). New York, Springer-Verlag, pages 383-423. 2008

arxiv created 2009/07/17 · arxiv updated 2009/12/01

Abstract

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature.

Cited by

• Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides

Discussions

• A Survey on Continuous Time Computations (2009) [hn, 1 points, 0 comments]

Related

• An input-output continuous-time version of Willems' lemma
• The complexity of computing in continuous time: space complexity is precision
• Neural Networks and Continuous Time
• Prediction theory in continuous time
• Infinite time computable model theory