Universality in Elementary Cellular Automata

نویسنده

  • Matthew Cook
چکیده

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 Wolfram’s numbering scheme [2]. Being a one dimensional cellular automaton, it consists of an infinitely long row of cells "Ci # i $ !%. Each cell is in one of the two states "0, 1%, and at each discrete time step every cell synchronously updates itself according to the value of itself and its nearest neighbors: &i, Ci ( F(Ci)1, Ci, Ci*1), where F is the following function:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power Spectral Analysis of Elementary Cellular Automata

Spectral analysis of elementary cellular automata is performed. A power spectrum is calculated from the evolution of 88 independent rules starting from random initial configurations. As a result, it is found that rule 110 exhibits 1/f noise during the longest time steps. Rule 110 has proved to be capable of supporting universal computation. These results suggest that there is a relationship bet...

متن کامل

An exhaustive experimental study of synchronization by forcing on elementary cellular automata

We study a way of coupling two configurations of the same cellular automaton rule for all elementary cellular automata (ECA). We experimentally show that there are only two possible behaviors: either synchronization for all coupling strength, or a phase transition. This transition is shown to belong to the directed percolation universality class, even for a non chaotic rule and for rules with p...

متن کامل

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.

متن کامل

Asynchronism Induces Second-Order Phase Transitions in Elementary Cellular Automata

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme consists in applying the rule with a fixed probability, called the synchrony rate. For some particular rules, varying the synchrony rate continuously produces a qu...

متن کامل

v 1 [ nl in . C G ] 4 O ct 2 00 6 Coalescing Cellular Automata

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both configurations become identical after a reasonable time. We prove coalescence for two elementary rules and show that there exists infinitely many coalescing CA. We then ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Complex Systems

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2004