Reversibility vs local creation/destruction

Abstract : Consider a network that evolves reversibly, according to nearest neighbours interactions. Can its dynamics create/destroy nodes? On the one hand, since the nodes are the principal carriers of information , it seems that they cannot be destroyed without jeopardising bijectivity. On the other hand, there are plenty of global functions from graphs to graphs that are non-vertex-preserving and bijective. The question has been answered negatively—in three different ways. 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 for discrete quantum gravity). 1998 ACM Subject Classification
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01800661
Contributor : Nicolas Durbec <>
Submitted on : Sunday, May 27, 2018 - 3:37:56 PM
Last modification on : Monday, February 10, 2020 - 12:17:01 PM
Long-term archiving on: Tuesday, August 28, 2018 - 12:21:47 PM

File

imrcgd-12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01800661, version 1
  • ARXIV : 1805.10330

Citation

Pablo Arrighi, Nicolas Durbec, Aurélien Emmanuel. Reversibility vs local creation/destruction. 2018. ⟨hal-01800661⟩

Share

Metrics

Record views

208

Files downloads

131