On Goles’ universal machines: A computational point of view - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2013

On Goles’ universal machines: A computational point of view

Résumé

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.

Dates et versions

hal-01217199 , version 1 (19-10-2015)

Identifiants

Citer

Bruno Martin. On Goles’ universal machines: A computational point of view. Theoretical Computer Science, 2013, Discrete Mathematical Structures: From Dynamics to Complexity, 504, pp.83-88. ⟨10.1016/j.tcs.2013.04.024⟩. ⟨hal-01217199⟩
65 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More