arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.6074nlin.CG
收藏

从混沌规则中产生的基本元胞自动机的复杂动力学

Complex dynamics of elementary cellular automata emerging from chaotic rules

Genaro J. Martinez, Andrew Adamatzky, Ramon Alonso-Sanz

摘要:

我们展示了分析具有混沌行为的元胞自动机(CA)的复杂动力学的技术。CA是研究涌现集体行为、复杂性、随机性以及有序和混沌系统之间相互作用的著名计算基底。已经进行了一些尝试来分类CA功能的时空动力学和预测任何给定的功能的行为。例子包括机械计算、λ和Z参数、平均场论、微分方程和数守恒特征。我们的目标是分类CA的基础上,他们的行为时,他们采取行动的历史模式,即CA与内存。我们证明了细胞状态的过渡规则丰富的记忆迅速转变混沌系统收敛到一个复杂的全球行为从几乎任何初始条件。因此,只需几个步骤,我们就可以选择混沌规则,而无需进行详尽的计算实验或重复使用额外的参数。我们在一维CA中提供了著名的混沌函数的分析,并使用多数记忆探索滑翔机动力学和反应分解自动机的动力学。

英文摘要:

We show techniques of analyzing complex dynamics of cellular automata (CA) with chaotic behaviour. CA are well known computational substrates for studying emergent collective behaviour, complexity, randomness and interaction between order and chaotic systems. A number of attempts have been made to classify CA functions on their space-time dynamics and to predict behaviour of any given function. Examples include mechanical computation, λ and Z-parameters, mean field theory, differential equations and number conserving features. We aim to classify CA based on their behaviour when they act in a historical mode, i.e. as CA with memory. We demonstrate that cell-state transition rules enriched with memory quickly transform a chaotic system converging to a complex global behaviour from almost any initial condition. Thus just in few steps we can select chaotic rules without exhaustive computational experiments or recurring to additional parameters. We provide analysis of well-known chaotic functions in one-dimensional CA, and decompose dynamics of the automata using majority memory exploring glider dynamics and reactions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑