Transient Behavior of Cellular Automaton Rule 110
نویسندگان
چکیده
The transient behavior of the I-dimensional 2-state 3-input cellular automaton rule 110, one of the simplest "edge of chaos" cellular automata, is investigated numerically. The simulations show that the average transient time Tave increases algebraically with system size N, Tave ~ N"', with a "" 1.08, and that the density of propagating objects (gliders) decays with time as ngl ~ r'Y with I "" 0.64. *Present address: Physics Department, Rockefeller University, 1230 York Avenue, New York, NY 10021.
منابع مشابه
Gliders in Rule 110
The existence of several periodic structures (known as gliders) in the evolution space of the one-dimensional cellular automaton Rule 110, has important lines of investigation in cellular automata theory such as: complex behavior, universal computation and self-reproduction. We investigate the types of gliders, their properties and production through collisions in Rule 110 and their representat...
متن کاملRule 110 Objects and Other Collision-Based Constructions
The one-dimensional cellular automaton Rule 110 shows a very ample and diversified glider dynamics. The huge number of collision-based reactions presented in its evolution space are useful to implement some specific (conventional and unconventional) computable process, hence Rule 110 may be used to implement any desired simulation. Therefore there is necessity of defining some interesting objec...
متن کاملUniversality in Elementary Cellular Automata
The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolf...
متن کاملImpartial games emulating one-dimensional cellular automata and undecidability
We study two-player take-away games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram’s rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right patterns, the rule 110 cellular automaton was recently proved Turing-complete by Matthew Cook. Hence, many questions regarding its behavior are algorithmically undecida...
متن کاملA Computation in a Cellular Automaton Collider Rule 110
A cellular automaton collider is a finite state machine build of rings of onedimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings. 1.
متن کامل