Intrinsic Universality of Causal Graph Dynamics

Simon Martiel
(Université Nice Sophia Antipolis)
Bruno Martin
(Université Nice Sophia Antipolis)

Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions induced by a local rule applied simultaneously on every vertex of the graph. Intrinsic universality is the ability of an instance of a model to simulate every other instance of the model while preserving the structure of the computation at every step of the simulation. In this work we present the construction of a family of intrinsically universal instances of causal graphs dynamics, each instance being able to simulate a subset of instances.

In Turlough Neary and Matthew Cook: Proceedings Machines, Computations and Universality 2013 (MCU 2013), Zürich, Switzerland, 9/09/2013 - 11/09/2013, Electronic Proceedings in Theoretical Computer Science 128, pp. 137–149.
Published: 4th September 2013.

ArXived at: https://dx.doi.org/10.4204/EPTCS.128.19 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org