Intrinsic Universality of Causal Graph Dynamics
Discrete Mathematics
2013-09-06 v1 Distributed, Parallel, and Cluster Computing
Abstract
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.
Keywords
Cite
@article{arxiv.1309.1272,
title = {Intrinsic Universality of Causal Graph Dynamics},
author = {Simon Martiel and Bruno Martin},
journal= {arXiv preprint arXiv:1309.1272},
year = {2013}
}
Comments
In Proceedings MCU 2013, arXiv:1309.1043