A Universal Cellular Automaton Without Sensitive Subsystems
Kari J.
A Universal Cellular Automaton Without Sensitive Subsystems
Kari J.
Julkaisun pysyvä osoite on:
https://urn.fi/URN:NBN:fi-fe2021042715425
https://urn.fi/URN:NBN:fi-fe2021042715425
Tiivistelmä
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.
Kokoelmat
- Rinnakkaistallenteet [19207]