A4 Refereed article in a conference publication
A Universal Cellular Automaton Without Sensitive Subsystems
Authors: Kari J.
Editors: Isokawa, T; Imai, K; Matsui, N; Peper, F; Umeo, H
Conference name: AUTOMATA
Publication year: 2015
Journal: Lecture Notes in Computer Science
Book title : Cellular Automata and Discrete Complex Systems 20th International Workshop, AUTOMATA 2014, Himeji, Japan, July 7-9, 2014, Revised Selected Papers
Series title: Lecture Notes in Computer Science
Volume: 8996
First page : 44
Last page: 55
Number of pages: 12
ISBN: 978-3-319-18811-9
ISSN: 0302-9743
DOI: https://doi.org/10.1007/978-3-319-18812-6_4
Self-archived copy’s web address: 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.
Downloadable publication This is an electronic reprint of the original article. |  |
