On Goles’ universal machines: A computational point of view

Bruno Martin 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MC3
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : This paper is a survey of E. Goles’ work on dynamical systems from the point of view of universality and computability. The models considered by E. Goles and his collaborators are presented: neural networks, reaction–diffusion automata, chip-firing games, sand piles, and artificial ants. Then, we recall the corresponding universality results. We also provide a classification of methods for proving universality and apply it to the aforementioned constructions.
Liste complète des métadonnées

Contributor : Bruno Martin <>
Submitted on : Monday, October 19, 2015 - 11:00:15 AM
Last modification on : Friday, April 12, 2019 - 10:18:09 AM




Bruno Martin. On Goles’ universal machines: A computational point of view. Theoretical Computer Science, Elsevier, 2013, Discrete Mathematical Structures: From Dynamics to Complexity, 504, pp.83-88. ⟨http://www.journals.elsevier.com/theoretical-computer-science/⟩. ⟨10.1016/j.tcs.2013.04.024⟩. ⟨hal-01217199⟩



Record views