On the computational power of dynamical systems and hybrid systems

We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and compare several notions of simulation between discrete and continuous systems. We give a general frame-work that allows discrete and continuous dynamical systems to be considered as computational machines. We introduce a new discrete model of computa-tion: the analog automaton model. We characterize the computational power of this model as P=poly in polynomial time and as unbounded in exponential time. We prove that many very simple dynamical systems from literature are able to simulate analog automata. From this results we deduce that many dynamical systems have intrinsically super-Turing capabilities.