Computation at the edge of chaos: phase transitions and emergent computation
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Computability with low-dimensional dynamical systems
Theoretical Computer Science
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
On the computational power of dynamical systems and hybrid systems
Theoretical Computer Science - Special issue on universal machines and computations
Dynamical recognizers: real time language recognition by analog computers
Theoretical Computer Science
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
On the effect of analog noise in discrete-time analog computations
Neural Computation
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Computable analysis: an introduction
Computable analysis: an introduction
The stability of saturated linear dynamical systems is undecidable
Journal of Computer and System Sciences
A new kind of science
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Reliable cellular automata with self-organization
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Perturbed Turing Machines and Hybrid Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
| Hi-index | 0.00 |
A computer is classically formalized as a universal Turing machine. However over the years a lot of research has focused on the computational properties of dynamical systems other than Turing machines, such cellular automata, artificial neural networks, mirrors systems, etc. In this talk we review some of the definitions that have been proposed for Turing universality of various systems, and the attempts to understand the relation between dynamical and computational properties of a system.