Some Aspects of a Complexity Theory for Continuous Time Systems

In this paper we survey previous work by the authors defining a complexity measure for certain continuous time systems. Starting point are energy functions of a particular structure. Global minimizers of such energies correspond to solutions of a given problem, for example an equilibrium point of an ordinary differential equation. The structure of such energies is used to define complexity classes for continuous problems and to obtain completeness results for those classes. We discuss as well algorithmic aspects of minimizing energy functions.

[1]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[2]  Pekka Orponen,et al.  A Survey of Continous-Time Computation Theory , 1997, Advances in Algorithms, Languages, and Complexity.

[3]  Olivier Bournez,et al.  A Survey on Continuous Time Computations , 2009, ArXiv.

[4]  Franco Scarselli,et al.  Inside PageRank , 2005, TOIT.

[5]  Ding-Zhu Du,et al.  Advances in Algorithms, Languages, and Complexity , 1997 .

[6]  John J. Shynk,et al.  Performance surfaces of a single-layer perceptron , 1990, IEEE Trans. Neural Networks.

[7]  Michail Zak.  Introduction to Terminal Dynamics , 1993, Complex Syst..

[8]  Klaus Meer,et al.  A Step towards a Complexity Theory for Analog Systems , 2002, Math. Log. Q..