2018/05/25 by Pablo Arrighi, Arrighi, Pablo, Durbec, Amélia +2
Computer Science · #Cellular Automata and Applications #Discrete Mathematics (cs.DM) #Distributed systems and fault tolerance #FOS: Computer and information sciences #Quantum Computing Algorithms and Architecture
paper · doi:10.48550/arxiv.1805.10330
openalex publication_date 2018/05/25 · openalex created_date 2022/10/06 · openalex updated_date 2026/07/28
Consider a network that evolves according to a reversible, nearest neighbours dynamics. Is the dynamics allowed to vary the size of the network? On the one hand it seems that, being the principal carriers of information, nodes cannot be destroyed without jeopardising bijectivity. On the other hand, there are plenty of bijective functions from the set of graphs to the set of graphs that are non-vertex-preserving. The question has been settled negatively -- for three different reasons. Yet, in this paper we do obtain reversible local node creation/destruction -- in three relaxed settings, whose equivalence we prove for robustness. We motivate our work both by theoretical computer science considerations (reversible computing, cellular automata extensions) and theoretical physics concerns (basic formalisms towards discrete quantum gravity).