Intrinsic Universality of Causal Graph Dynamics

@inproceedings{Martiel2013IntrinsicUO,
  title={Intrinsic Universality of Causal Graph Dynamics},
  author={Simon Martiel and Bruno Martin},
  booktitle={MCU},
  year={2013}
}
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… 

Figures from this paper

An Intrinsically Universal Family of Causal Graph Dynamics
TLDR
This work presents an intrinsically universal family of Causal Graph Dynamics, and gives insight on why it seems impossible to improve this result to the existence of a unique intrinsically universal instance.
Universality of causal graph dynamics
TLDR
This work studies three different notions of simulation for Causal Graph Dynamics, each of them leading to a definition of universality, the ability simulating every other instances of another model of computation.
Algorithmical and mathematical approaches of causal graph dynamics. (Approches informatique et mathématique des dynamiques causales de graphes)
TLDR
Causal graph dynamics generalize cellular automata to arbitrary, bounded degree, time-varying graphs, and shows the equivalence of these two definitions, extending the famous result of Curtis-Hedlund-Lyndon's theorem.
Generalized Cayley Graphs and Cellular Automata over them
TLDR
A notion of graph associated to a language is proposed, which conserves or generalizes a number of useful features of Cayley graphs and cellular automata, and is stable under composition and under inversion.
Cellular automata over generalized Cayley graphs
TLDR
A notion of graphs is proposed, which preserves or generalizes a number of useful features of Cayley graphs, and extends cellular automata theory to these arbitrary, bounded degree, time-varying graphs.
Reversibility vs local creation/destruction
TLDR
This paper obtains reversible local node creation/destruction—in three relaxed settings, whose equivalence the authors prove for robustness, both by theoretical computer science considerations and theoretical physics concerns.

References

SHOWING 1-10 OF 13 REFERENCES
Generalized Cayley Graphs and Cellular Automata over them
TLDR
A notion of graph associated to a language is proposed, which conserves or generalizes a number of useful features of Cayley graphs and cellular automata, and is stable under composition and under inversion.
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
TLDR
A simulation of reversible ca (r-ca) with reversible pca is built contradicting the intuition of known undecidability results, and a 1-r-CA is built which is intrinsic universal, i.e., able to simulate any 1- r-ca.
Partitioned quantum cellular automata are intrinsically universal
TLDR
This work shows that any QCA can be put into the form of a PQCA, and reconciles all the non-axiomatic definitions of QCA, showing that they can all simulate one another, and hence that they are all equivalent to the axiomatic definition.
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can
Cellular Automata Universality Revisited
We propose an original arithmetization of cellular automata independent of Turing machines and present a new classification of universal cellular automata according to the way universality is
Intrinsically Universal Cellular Automata
TLDR
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior and discusses construction methods for small intrinsically universal Cellular automata before discussing techniques for proving non universality.
How Common Can Be Universality for Cellular Automata?
TLDR
It is shown that captive cellular automata are almost all intrinsically universal, and it is shown however that intrinsic universality is undecidable for captive Cellular automata.
Structural Complexity I
TLDR
This volume is written for undergraduate students who have taken a first course in Formal Language Theory and presents the basic concepts of structural complexity, thus providing the background necessary for the understanding of complexity theory.
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)
The Universal Turing Machine
...
...