Intrinsic Universality in Automata Networks II: Glueing and Gadgets - Ecole Centrale de Marseille
Article Dans Une Revue Theoretical Computer Science Année : 2024

Intrinsic Universality in Automata Networks II: Glueing and Gadgets

Résumé

An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. This paper is the second of a series about intrinsic universality, i.e. the ability for a family of AN to simulate arbitrary AN. We develop a proof technique to establish intrinsic simulation and universality results which is suitable to deal with families of symmetric networks where connections are non-oriented. It is based on an operation of glueing of networks, which allows to produce complex orbits in large networks from compatible pseudo-orbits in small networks. As an illustration, we give a short proof that the family of networks where each node obeys the rule of the 'game of life' cellular automaton is strongly universal. In the third paper of the series, we heavily rely on this proof technique to show intrinsic universality results of various families with particular update schedules.
Fichier sous embargo
Fichier sous embargo
0 6 19
Année Mois Jours
Avant la publication
lundi 12 mai 2025
Fichier sous embargo
lundi 12 mai 2025
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-04199857 , version 1 (11-09-2023)
hal-04199857 , version 2 (21-10-2024)

Identifiants

Citer

Martín Ríos Wilson, Guillaume Theyssier. Intrinsic Universality in Automata Networks II: Glueing and Gadgets. Theoretical Computer Science, 2024, ⟨10.1016/j.tcs.2024.114779⟩. ⟨hal-04199857v2⟩

Relations

58 Consultations
70 Téléchargements

Altmetric

Partager

More