On Goles’ universal machines: A computational point of view

Bruno Martin 1
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.
Type de document :
Article dans une revue
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〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01217199
Contributeur : Bruno Martin <>
Soumis le : lundi 19 octobre 2015 - 11:00:15
Dernière modification le : mardi 20 octobre 2015 - 01:04:53

Identifiants

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

47