Operator Representation and Class Transitions in Elementary Cellular Automata

نویسندگان

چکیده

We exploit the mirror and complementary symmetries of elementary cellular automata (ECAs) to rewrite their rules in terms logical operators. The operator representation based on these fundamental enables us construct a periodic table ECAs that maps all unique clusters similar asymptotic behavior. also expand automaton (ECA) dynamics by introducing parameter scales pace with which operators iterate system. While tuning this continuously, further emergent behavior is unveiled as several undergo multiple phase transitions between periodic, chaotic complex (class 4) This extension provides an environment for studying class ECAs. Moreover, emergence 4 structures can potentially enlarge capacity many ECA universal computation.

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Cellular Automata: Elementary Cellular Automata

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...

متن کامل

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...

متن کامل

Phase Transitions in the Computational Complexity of "Elementary'' Cellular Automata

A study of the computational complexity of determining the "Garden-of-Eden" states (i.e., states without any pre-images) of one-dimensional cellular automata (CA) is reported. The work aims to relate phase transitions in the computational complexity of decision problems, with the type of dynamical behavior exhibited by the CA time evolution. This is motivated by the observation of critical beha...

متن کامل

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...

متن کامل

Elementary Cellular Automata with Memory

Standard cellular automata (CA) are ahistoric (memoryless), that is, the new state of a cell depends on the neighborhood configuration of only the preceding time step. This article introduces an extension to the standard framework of CA by considering automata with memory capabilities. While the update rules of the CA remain unaltered, a history of all past iterations is incorporated into each ...

متن کامل

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


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

ژورنال

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

سال: 2022

ISSN: ['0891-2513']

DOI: https://doi.org/10.25088/complexsystems.31.4.415