Skip to main content
Conference ProceedingsOPEN ACCESS

Universal time-symmetric number-conserving cellular automaton

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9099 155-168
DOI: 10.1007/978-3-662-47221-7_12
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Maldonado, D., Moreira, A., & Gajardo, A. (2015). Universal time-symmetric number-conserving cellular automaton. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9099, pp. 155–168). Springer Verlag. https://doi.org/10.1007/978-3-662-47221-7_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free