Reversible space–time simulation of cellular automata
✍ Scribed by Jérôme O. Durand-Lose
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 276 KB
- Volume
- 246
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
The goal of this paper is to design a reversible d-dimensional cellular automaton which is capable of simulating the behavior of any given d-dimensional cellular automaton over any given conÿguration (even inÿnite) with respect to a well suited notion of simulation we introduce. We generalize a problem which was originally addressed in a paper by To oli in 1977. He asked whether a d-dimensional reversible cellular automaton could simulate d-dimensional cellular automata. In the same paper he proved that there exists a (d + 1)-dimensional reversible cellular automaton which can simulate a given d-dimensional cellular automaton. To prove our result, we use as an intermediate model partition cellular automata deÿned by Morita et al. in 1989.
📜 SIMILAR VOLUMES
The reversibility problem for 90/150 cellular automata (both null and periodic boundary) is tackled using continua& and regular expressions. A 90/150 cellular automata can be uniquely encoded by a string over the alphabet (0, 1). It is shown that the set of strings which correspond to reversible 90/
We implement the cellular automata model proposed by Stau er and Weisbuch in 1992 to describe the response of the immune system to antigens in the presence of medications. The model contains two thresholds, Â1 and Â2, suggested by de Boer, Segel, and Perelson to present the minimum ÿeld needed to st