Reversible Causal Graph Dynamics
Discrete Mathematics
2017-06-06 v3 Formal Languages and Automata Theory
Abstract
Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries: shift-invariance (it acts everywhere the same) and causality (information has a bounded speed of propagation). We add a further physics-like symmetry, namely reversibility. KEYWORDS: Bijective, invertible, injective, surjective, one-to-one, onto, Cayley graphs, Hedlund, Block representation, Lattice-gas automaton, Reversible Cellular Automata.
Keywords
Cite
@article{arxiv.1502.04368,
title = {Reversible Causal Graph Dynamics},
author = {Pablo Arrighi and Simon Martiel and Simon Perdrix},
journal= {arXiv preprint arXiv:1502.04368},
year = {2017}
}
Comments
33 pages, 10 figures