A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
A Universal Cellular Automaton Without Sensitive Subsystems
Tekijät: Kari J.
Toimittaja: Isokawa, T; Imai, K; Matsui, N; Peper, F; Umeo, H
Konferenssin vakiintunut nimi: AUTOMATA
Julkaisuvuosi: 2015
Journal: Lecture Notes in Computer Science
Kokoomateoksen nimi: Cellular Automata and Discrete Complex Systems 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers
Sarjan nimi: Lecture Notes in Computer Science
Vuosikerta: 8996
Aloitussivu: 44
Lopetussivu: 55
Sivujen määrä: 12
ISBN: 978-3-319-18811-9
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-319-18812-6_4
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/3922036
We construct a one-dimensional reversible cellular automaton that is computationally universal in a rather strong sense while being highly non-sensitive to initial conditions as a dynamical system. The cellular automaton has no sensitive subsystems. The construction is based on a simulation of a reversible Turing machine, where a bouncing signal activates the Turing machine to make single steps whenever the signal passes over the machine.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
