Universal Time-Symmetric Number-Conserving Cellular Automaton

Abstract : We show the existence of Turing-universal and intrinsically universal cellular automata exhibiting both time symmetry and number conservation; this is achieved by providing a way to simulate reversible CA with time-symmetric CA, which preserves the number-conserving property. We also provide some additional results and observations concerning the simulation relations between reversible, time-symmetric and number-conserving CA in the context of partitioned CA.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01442471
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:13 PM
Last modification on : Monday, January 23, 2017 - 12:48:41 PM
Long-term archiving on: Friday, April 21, 2017 - 4:10:44 PM

File

338243_1_En_12_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Diego Maldonado, Andrés Moreira, Anahí Gajardo. Universal Time-Symmetric Number-Conserving Cellular Automaton. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.155-168, ⟨10.1007/978-3-662-47221-7_12⟩. ⟨hal-01442471⟩

Share

Metrics

Record views

76

Files downloads

161