| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4633306 | Applied Mathematics and Computation | 2009 | 7 Pages |
Abstract
A computer is classically formalised as a universal Turing machine or a similar device. 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 paper we propose a unifying formalism derived from a generalisation of Turing’s arguments. Then we review some of universal systems proposed in the literature and show that are particular case of this formalism. Finally, we review some of the attempts to understand the relation between dynamical and computational properties of a system.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jean-Charles Delvenne,
