Synchronization and predictability under rule 52 , a cellular automaton reputedly of class 4 Joana

نویسندگان

  • Joana G. Freire
  • Jason A.C. Gallas
چکیده

We study the complexity exhibited by the gliders of rule 52, a totalistic cellular automaton reputedly capable of highly intricate behaviors. Such gliders are responsible for information flow and long-range spatial correlations frequently used to classify complexity. We discover an unexpected simplicity in all computable gliders, shown to arise from simple juxtaposition between active and inactive synchronization patches linked by a remarkably small set of communication interfaces. We classify such interfaces and argue rule 52 to be interesting but of limited asymptotic complexity. © 2007 Elsevier B.V. All rights reserved. One of the most challenging and interesting phenomena of dynamical systems is that connected with the spontaneous generation of complex structures and patterns in space and time [1–3]. While the emergence of periodic and chaotic temporal behaviors has been studied in detail during the last two decades, the genesis of spatio-temporal regularities in extended chaotic systems with several degrees of freedom remains a much less understood topic. A very popular way of investigating complicated spatiotemporal behaviors is by assuming their complexity to be due to cooperative effects between a number of smaller subsystems evolving under simple rules and operating on relatively few local degrees of freedom. This “reductionistic approach”, which in essence asserts that complex things may be reduced or explained by simpler “more fundamental” parts, is a point of view that may be traced back to the ancient pre-Socratic Greek atomistic view of nature or, much more recently, to Descartes, who argued that, e.g., animals could be reductively explained as automata [4]. Descartes envisioned the world like a huge machine, * Corresponding author. E-mail addresses: [email protected] (J.G. Freire), [email protected]

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

ثبت نام

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

منابع مشابه

Spatial updating, spatial transients, and regularities of a complex automaton with nonperiodic architecture.

We study the dynamics of patterns exhibited by rule 52, a totalistic cellular automaton displaying intricate behaviors and wide regions of active/inactive synchronization patches. Systematic computer simulations involving 2(30) initial configurations reveal that all complexity in this automaton originates from random juxtaposition of a very small number of interfaces delimiting active/inactive ...

متن کامل

Predicting Cellular Automata

We explore the ability of a locally informed individual agent to predict the future state of a cell in systems of varying degrees of complexity using Wolfram’s onedimensional binary cellular automata. We then compare the agent’s performance to that of two small groups of agents voting by majority rule. We find stable rules (Class I) to be highly predictable, and most complex (Class IV) and chao...

متن کامل

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

متن کامل

Dynamics of Wolfram’s Class III Cellular Automaton Rule 73

In this paper, the dynamics of elementary cellular automaton (ECA) rule 73 is investigated under the framework of the bi-infinite symbolic sequence space. This paper provides a rigorous mathematical analysis for the evolution of symbol sequences in some subsystems of rule 73. ECA rule 73, a member of Wolfram’s class III and Chua’s complex Bernoulli-shift rules, defines many more subsystems with...

متن کامل

A Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata

The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata and present a comparative stud...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2007