On the computational power of dynamical systems and hybrid systems

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