Turing Universality in Dynamical Systems
- Cite this paper as:
- Delvenne JC. (2006) Turing Universality in Dynamical Systems. In: Beckmann A., Berger U., Löwe B., Tucker J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.