cellular automaton_automaton储物柜_细胞自动机(2)

g。, Conway's Game of Life, of universal computation, and of self-replication (e。g。, as in a Von Neumann universal constructor)。 Moreover, the general construction and the proof also applies to the more general class of synchronous automata networks (inhomogeneous networks of automata over directed graphs, allowing external inputs – which includes cellular automata as a special case), showing constructively how their behaviour may be asynchronously realized by a corresponding asynchronous automata network。

Several studies have implemented asynchronous models and found that their behaviour differs from the synchronous ones。 Bersini and Detours (1994) have shown how sensitive Conway's Game of Life is to the updating scheme。 Any interesting behaviour disappears in the asynchronous case。cellular automaton Harvey and Bossomaier (1997) pointed out that stochastic updating in random boolean networks results in the expression of point attractors only: there is no repeatable cyclic behaviour, although they introduced the concept of loose cyclic attractors。

Kanada (1994) has shown that some one-dimensional CA models that generate non-chaotic patterns when updated synchronously generate edge of chaos patterns when randomised。 Orponen (1997) has demonstrated that any synchronously updated network of threshold logic units (see Artificial neuron) can be simulated by a network that has no constraints on the order of updates。 Sipper et al。 (1997) investigated the evolution of non-uniform CAs that perform specific computing tasks。 These models relax the normal requirement of all nodes having the same update rule。cellular automaton

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/shouji/article-51784-2.html