Part II

Tutorials and Reviews
International Journal of Bifurcation and Chaos, Vol. 13, No. 9 (2003) 2377–2491
c World Scientific Publishing Company
A NONLINEAR DYNAMICS PERSPECTIVE OF

WOLFRAM’S NEW KIND OF SCIENCE.
PART II: UNIVERSAL NEURON
LEON O. CHUA, VALERY I. SBITNEV and SOOK YOON

Department of Electrical Engineering and Computer Sciences,
University of California at Berkeley,
Berkeley, CA, 94720, USA
Received March 1, 2003; Revised May 15, 2003
Wolfram’s celebrated three-input Cellular Automata is further developed and extended from
the perspective of neural networks. A single explicit formula involving two nested absolute-value
functions and eight adjustable parameters called synaptic weights, is presented. Such a neuron
is proved to be universal by specifying the synaptic weights of all 256 local rules.
Applying the nonlinear dynamics concepts developed from Part I of this multipart series of
papers, we present the rational for partitioning the entire set of 256 local rules into 16 distinct
gene families, each composed of 16 gene siblings. Such a partitioning allows us to explain, if not
predict, the pattern features generated from each local rule. Finally, these 16 gene families of
Cellular Automata rules are encoded onto a new compact and insightful representation called
the “double-helix torus.”
Keywords: Cellular Automata; cellular neural networks; CNN; universal neuron; universal Turing
machine; double-helix torus.
1. Firing and Quenching Patterns It is important to remember that, for rea-

sons already articulated in Part I, we will con-
The 256 local rules studied incisively by Wolfram
tinue to use {−1, 1} as the logic states in this
in A New Kind of Science [Wolfram, 2002] for the
paper, unless specified otherwise. The only ex-
one-dimensional binary Cellular Automata (1D CA) ception is when one wishes to translate the last
shown in Fig. 1 are encoded onto the vertices of 256 column (γ7 γ6 γ5 γ4 γ3 γ2 γ1 γ0 ) of the truth table
corresponding Boolean cubes and listed in Table 1 (lower-right corner in Table 1) into a binary for-
of [Chua et al., 2002]. This table is redrawn in the mat (β7 β6 β5 β4 β3 β2 β1 β0 ), in which case we simply
following four pages (Table 1) to emphasize the change each γj = −1 to βj = 0. Observe that
correlation between the red vertices of each Boolean βj and γj are related via the one-to-one mapping
cube with the corresponding firing patterns of an ar- γj = 2βj − 1, or equivalently, βj = 12 (γj + 1).
tificial neuron whose “sphere of influence” consists The number N below each Boolean cube in Ta-
of its two nearest neighbors [Chua, 1998]. ble 1 is the decimal expression of the corresponding
Each local rule “N ” of a 1D CA can be de- binary number (β7 β6 β5 β4 β3 β2 β1 β0 ); namely,
coded from the corresponding Boolean cube “N ” in
Table 1 by associating each RED vertex of this cube N = β7 • 2 7 + β 6 • 2 6 + β 5 • 2 5 + β 4 • 2 4
with the logic state 1, and each BLUE vertex with + β3 • 2 3 + β2 • 2 2 + β1 • 2 1 + β0 • 2 0
7

the logic state −1 (or logic state 0 when {0, 1} are
chosen as the binary states). = βk 2 k . (1)
k=0
2377
2378 L. O. Chua et al.
Cell
Cell
(N-2) Cell Cell
Cell Cell (i+1)
(N-1) Cell Cell Cell i
N (i-1)
0 1 2
(a)
input
ui −1 output
ui state yi
xi
ui +1
(b)
Fig. 1. (a) A one-dimensional Cellular Automata (CA) made of (N +1) identical cells with a periodic boundary condition.
Each cell “i” is coupled only to its left neighbor cell (i–1) and right neighbor cell (i+1). (b) Each cell “i” has a state variable
xi (t), an output variable yi (t), and three constant binary inputs ui−1 , ui and ui+1 .
Observe that each vertex k of the Boolean Recall from [Chua et al., 2002] that the Boolean
cube is associated with a corresponding multipli- cube ID number N is printed in Red in Table 1
cation factor 2k (depicted in the lower-left corner in if its associated local rule N is linearly sepa-
Table 1). Consequently, we can calculate the deci- rable. Otherwise, N is printed in Blue. Observe
mal number N associated with each Boolean cube that only 104 out of 256 local rules are linearly
by simply adding the multiplication factors asso- separable.
ciated with all RED vertices. For example, the It is very important to remember that the dec-
Boolean cube 110 in Table 1 has five RED ver- imal number N in Table 1 plays two roles: As an
tices (6, 5, 3, 2, 1), whose corresponding multiplica- identification (ID) number in decimal format, or as
tion factors are 26 = 64, 25 = 32, 23 = 8, 22 = 4, a code for specifying the truth table (local rule) when
and 21 = 2. Hence, N = 64 + 32 + 8 + 4 + 1 = 110 N is translated into its binary format [Chua, 1998;
as expected. Wolfram, 2002].
A Nonlinear Dynamics Perspective of Wolfram’s New Kind of Science. Part II 2379
Table 1. Encoding 256 local rules defining a binary 1D CA onto 256 corresponding “Boolean Cubes”.
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
0 1 2 3 4 5 6 7
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
8 9 10 11 12 13 14 15
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
16 17 18 19 20 21 22 23
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
24 25 26 27 28 29 30 31
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
32 33 34 35 36 37 38 39
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
40 41 42 43 44 45 46 47
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
48 49 50 51 52 53 54 55
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
56 57 58 59 60 61 62 63
N = decimal equivalent of binary number vertex u it−1 u it u it+1 u it +1
β 7 β 6 β 5 β 4 β 3 β 2 β 1 β 0
k
u it 0 -1 -1 -1 γ 0
(-1,1,-1)
22 = 4 2
(-1,1,1)
3 23 = 8 1 -1 -1 1 γ 1
(1,1,1)
2 -1 1 -1 γ 2
(1,1,-1)
26 = 64 27 = 128
γ
6 7
20 = 1 0 1 u it+1 3 -1 1 1 3
21 = 2
(-1,-1,-1) (-1,-1,1)
4 1 -1 -1 γ 4
(1,-1,1)
24 = 16 4
(1,-1,-1)
5 25 = 32
Rule N 5 1 -1 1 γ 5
vertex u it−1
k t +1 t
u i ( i −1 ut t
,u ,u ) = 1 βk = 1 6 1 1 -1 γ 6
i i +1
k t +1
u i ( i −1ut t
i
t
i +1 ,u ,u ) = −1 βk = 0 7 1 1 1 γ 7
Table 1. (Continued )
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
64 65 66 67 68 69 70 71
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
72 73 74 75 76 77 78 79
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
80 81 82 83 84 85 86 87
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
88 89 90 91 92 93 94 95
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
96 97 98 99 100 101 102 103

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
104 105 106 107 108 109 110 111

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
112 113 114 115 116 117 118 119

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
120 121 122 123 124 125 126 127

β 7 β 6 β 5 β 4 β 3 β 2 β 1 β 0
k
u it 0 -1 -1 -1 γ 0
(-1,1,-1)
22 = 4 2
(-1,1,1)
3 23 = 8 1 -1 -1 1 γ 1
(1,1,1)
2 -1 1 -1 γ 2
(1,1,-1)
26 = 64 27 = 128
γ
6 7 t
20 = 1 0 1 u i +1 3 -1 1 1 3
21 = 2
(-1,-1,-1) (-1,-1,1)
4 1 -1 -1 γ 4
(1,-1,1)
24 = 16 4
(1,-1,-1)
5 25 = 32
Rule N 5 1 -1 1 γ 5
vertex u it−1
k t +1 t
u i ( i −1 ut t
,u ,u ) = 1 βk = 1 6 1 1 -1 γ 6
i i +1
k t +1
u i ( i −1ut t
i
t
i +1 ,u ,u ) = −1 βk = 0 7 1 1 1 γ 7
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
128 129 130 131 132 133 134 135

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
136 137 138 139 140 141 142 143

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
144 145 146 147 148 149 150 151

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
152 153 154 155 156 157 158 159

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
160 161 162 163 164 165 166 167

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
168 169 170 171 172 173 174 175

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
176 177 178 179 180 181 182 183

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
184 185 186 187 188 189 190 191

β 7 β 6 β 5 β 4 β 3 β 2 β 1 β 0
k
u it 0 -1 -1 -1 γ 0
(-1,1,-1)
22 = 4 2
(-1,1,1)
3 23 = 8 1 -1 -1 1 γ 1
(1,1,1)
2 -1 1 -1 γ 2
(1,1,-1)
26 = 64 27 = 128
γ
6 7 t
20 = 1 0 1 u i +1 3 -1 1 1 3
21 = 2
(-1,-1,-1) (-1,-1,1)
4 1 -1 -1 γ 4
(1,-1,1)
24 = 16 4
(1,-1,-1)
5 25 = 32
Rule N 5 1 -1 1 γ 5
vertex u it−1
k t +1 t
u i ( i −1 ut t
,u ,u ) = 1 βk = 1 6 1 1 -1 γ 6
i i +1
k t +1
u i ( i −1ut t
i
t
i +1 ,u ,u ) = −1 βk = 0 7 1 1 1 γ 7
2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
192 193 194 195 196 197 198 199

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
200 201 202 203 204 205 206 207

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
208 209 210 211 212 213 214 215

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
216 217 218 219 220 221 222 223

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
224 225 226 227 228 229 230 231

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
232 233 234 235 236 237 238 239

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
240 241 242 243 244 245 246 247

2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7 6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5 4 5 4 5 4 5 4 5
248 249 250 251 252 253 254 255

β 7 β 6 β 5 β 4 β 3 β 2 β 1 β 0
k
u it 0 -1 -1 -1 γ 0
(-1,1,-1)
22 = 4 2
(-1,1,1)
3 23 = 8 1 -1 -1 1 γ 1
(1,1,1)
2 -1 1 -1 γ 2
(1,1,-1)
26 = 64 27 = 128
γ
6 7 t
20 = 1 0 1 u i +1 3 -1 1 1 3
21 = 2
(-1,-1,-1) (-1,-1,1)
4 1 -1 -1 γ 4
(1,-1,1)
24 = 16 4
(1,-1,-1)
5 25 = 32
Rule N 5 1 -1 1 γ 5
vertex u it−1
k t +1 t
u i ( i −1 ut t
,u ,u ) = 1 βk = 1 6 1 1 -1 γ 6
i i +1
k t +1
u i ( i −1ut t
i
t
i +1 ,u ,u ) = −1 βk = 0 7 1 1 1 γ 7
Finally, observe that a three-pixel colored se- emulating local rule 110 will “fire” (by switching to
quence, henceforth called a neighborhood pattern Pk , 1 in a CNN [Chua, 1998], or by initiating an ac-
is printed next to each vertex k in the lower-left tion potential in a real neuron), if, and only if, it
corner of Table 1. The color sequence of each neigh- recognizes one of the five firing patterns in Table 2.
borhood pattern Pk is defined by the coordinates Table 3 shows the quenching patterns associ-
(uti−1 , uti , uti+1 ) of vertex
k in the truth table ated with the local rule 110. Note that they corre-
(bottom-right of Table 1), where “1” is encoded in spond to the blue vertices in the Boolean cube 110
red, and “−1” is encoded in blue. For example, the in Table 1. Just like the synapses of a neuron can
neighborhood pattern P3 corresponding to vertex 3 be either excitatory, or inhibitory, the neighborhood
of every Boolean cube in Table 1 has the same color patterns associated with a local rule can be either
sequence (blue, red, red). “firing” or “quenching”. It is the subtle combination
A neighborhood pattern Pk is said to be a fir- of the “firing” and “quenching” patterns of a local
ing pattern for a local rule N iff the vertex k of the rule which gives rise to its information processing
corresponding Boolean cube N in Table 1 is colored capabilities [Chua & Roska, 2002].
in RED. Otherwise, it is called a quenching pattern.
The significance of the firing patterns is that
a cell Ci in any one-dimensional input pattern (see
2. A Universal Neuron
Fig. 1) will be RED in the next generation if, and The main result from [Chua et al., 2002] is a
only if, the color pattern of the three contiguous theorem asserting that each of the 256 local rules
cells (Ci−1 , Ci , Ci+1 ) coincides with one of the fir- studied in [Wolfram, 2002] for the 1D CA shown
ing patterns of the Boolean cube. For example, for in Fig. 1 can be generated from a single scalar
the local rule 110, only the five firing patterns shown nonlinear differential equation with at most eight
in Table 2 will result in a red cell at Ci in the next parameters. This 8-parameter family of differential
generation. In neural network parlance, a neuron Ci equations is given explicitly by:

ẋi = − xi + xi + 1 − xi − 1

+ z2 + c2 z1 + c1 (z0 + b1 ui−1 + b2 ui + b3 ui+1)
(2)
xi(0) = 0
i = 0, 1, 2, . . . , N .1
For each local rule N = 0, 1, 2, . . . , 255 from Table 1, there exists at least one parameter vector
[c2 , c1 , z2 , z1 , z0 , b1 , b2 , b3 ] ∈ R8 such that Eq. (2) converges to an equilibrium point xi (Q) for each cell Ci .
Moreover, the output
∆ 1
yi (t) = (|xi (t) + 1| − |xi (t) − 1|) (3)
2
of cell Ci in Fig. 1 converges to either yi (Q) = 1 or yi (Q) = −1 as prescribed by the Boolean cube N for
each of the eight distinct inputs (ui−1 , ui , ui+1 ) from the truth table (bottom-right corner of Table 1).
In particular,

yi (Q) = sgn z2 + c2 z1 + c1 (z0 + b1ui−1 + b2 ui + b3 ui+1)
(4)
1
We have abused our notation by using N to denote either the number of cells in Fig. 1, or the ID number of a local rule.
The choice will be clear from the context.
Table 2. Firing Patterns for local rule 110.
Vertex Decimal Equivalent

Firing pattern Pk
number code Boolean code
1 (-1,-1, 1) (0,0,1) P1
2 (-1, 1,-1) (0,1,0) P2
3 (-1,1,1) (0,1,1) P3
5 (1,-1,1) (1,0,1) P5
6 (1,1,-1) (1,1,0) P6
Table 3. Quenching Patterns for local rule 110.
Vertex Decimal Equivalent

Quenching pattern Pk
number code Boolean code
0 (-1,-1,-1) (0,0,0) P0
4 (1,-1,-1) (1,0,0) P4
7 (1,1,1) (1,1,1) P7
where2

∆ 1, x>0
sgn[x] = (5)
−1 , x<0
It follows from Eq. (4) that the discrete-time evolution
t
ut+1
i = F u i−1
, u t t
i
, u i+1
t = 0, 1, 2, . . . , ∞ (6)
i = 0, 1, 2, . . . , N
2
Although sgn[0] is undefined, we can always choose the parameters such that the argument for sgn[•] in Eq. (4) is never zero.
of the 1D CA in Fig. 1 can be specified explicitly to define a discrete-time neuron, each with three
via a single formula: inputs (ui−1 (t), ui (t), ui+1 (t)) and (uti−1 , uti , uti+1 ),
respectively. We call such neurons universal because
Universal CA Map
by tuning only eight synaptic weights, it is possible
for the neuron to implement any one of the 256
F uti−1, uti, uti+1) Boolean Functions of three inputs. Moreover, our

universal neuron is the simplest possible realization
= sgn z2 + c2 z1 + c1 (z0 in the sense that it requires only eight adjustable
parameters, which is equal to the number of bits
+ b1uti−1 + b2uti + b3 uti+1) (7) to specify a local rule (bottom-right of Table 1). A
practical implementation of this universal neuron
via a CMOS integrated circuit is given in [Dogaru
Observe that since uti−1 ∈ {−1, 1}, uti ∈ et al., 2003].
{−1, 1}, and uti+1 ∈ {−1, 1}, the nonlinear map Note that our neuron is also universal in the
sense of a Universal Turing machine because at
F : {−1, 1} × {−1, 1} × {−1, 1} → {−1, 1} (8) least one of the 256 local rules which it emulates
is a discrete map. (say, rule 110) is capable of universal computation
The eight parameters {z2 , c2 , z1 , c1 , z0 , b1 , b2 , b3 } [Wolfram, 2002].
in Eq. (7) for each local rule N are real numbers As a final remark for this section, we note that
belonging to a non-empty subregion R(N ) ⊂ R8 since the discrete map F is defined via an explicit
of the parameter space, where N = 0, 1, 2, . . . , 255. formula in Eq. (7), rather than by an algorithm, we
Since each βk in Eq. (1) can assume only the value can, at no extra cost, allow the three input variables
“0” or “1”, whereas each of the eight parameters uti−1 , uti , uti+1 to be any real numbers. In the special
{z2 , c2 , z1 , c1 , z0 , b1 , b2 , b3 } in Eq. (7) can assume case where each input is restricted to assume only
any real number from −∞ to ∞, one can expect the value 1 or −1, as in a CA, the map F will auto-
to find many points in R8 which map into the matically output a 1 or a −1. One bonus we get for
same local rule N . From extensive statistical sim- extending the input space to include all real num-
ulations we have found the parameter subregion bers, namely, uti−1 ∈ R, uti ∈ R and uti+1 ∈ R, is
R(N ) to be relatively large, at least for all of the that it allows us to exploit and extend the results
local rules we have examined so far. This empirical in [Sbitnev et al., 2001] and [Sbitnev & Chua, 2002]
observation suggests that the map F is quite ro- to the study of cellular automata where virtually
bust, relative to the choice of the eight real param- no analytical tools are applicable. In particular, it
eters {z2 , c2 , z1 , c1 , z0 , b1 , b2 , b3 }, henceforth called is more enlightening and mathematically tractable
synaptic weights in view of its close analogy to the to view the discrete-time evolution of Eq. (6) as a
synapses characterizing the task to be performed scalar nonlinear difference equation.
by an artificial neuron [Chua, 1998].
For future reference, as well as a constructive
proof that the map F can realize any one of the 256 3. Gallery of One-Dimensional
local rules, one set of synaptic weights (among in- Cellular Automata
finitely many other valid weights) is given in Table 4 For future reference, some useful information as-
for each local rule. It would be instructive for the sociated with each local rule N = 0, 1, 2, . . . , 255
reader to substitute the eight synaptic weights in are listed in Table 5, where each local rule occupies
this table, for each local rule N , into Eq. (7) and one-fourth of a page. In particular, each quadrant
verify that all of the 256 Boolean cubes in Table 1 contains the following data3 :
can be so generated.
From the perspective of information process- 1. Top row: The local rule number N and its eight-
ing, we can use Eqs. (2) and (3) to define a bit Boolean function representation are given in
continuous-time neuron, or use Eqs. (6) and (7) the upper left-hand corner. The complexity index
3
The bottom pattern for each local rule N is identical to that given in [Wolfram, 2002], and in [Chua et al., 2002]. We take
this opportunity to point out an error in the latter reference (p. 2705) where the red and blue colors of all lines except the
initial condition in the pattern given for local rule 159 should be changed to blue and red, respectively.
Table 4. Parameters for the universal CA map.
Local Synaptic weights Local Synaptic weights

Rule Rule
N z2 c2 z1 c1 z0 b1 b2 b3 N z2 c2 z1 c1 z0 b1 b2 b3
0 -3 -1 -3 1 -2 3 -5 -3 32 1 -1 2 -1 1 3 5 3
1 3 -1 0 -1 -1 6 -5 -4 33 1 -1 -3 1 -5 1 -5 2
2 -6 1 3 -1 4 -3 -3 3 34 1 -1 6 -1 -1 -6 -3 -2
3 1 -1 6 -1 -3 -2 -1 6 35 3 -1 1 -1 -4 3 -5 -1
4 -6 1 5 -1 2 -4 3 -4 36 -6 1 6 -1 -2 -6 4 -6
5 -4 1 5 -1 -3 4 -1 4 37 3 -1 -4 1 1 6 -2 -5
6 3 -1 -1 -1 6 6 -4 -4 38 6 -1 -2 -1 2 3 6 4
7 -4 1 4 -1 -5 6 1 3 39 3 -1 -5 1 4 5 -2 -6
8 -4 1 4 -1 1 -6 1 1 40 3 -1 0 -1 -4 -5 -6 3
9 1 -1 -6 1 -2 -2 -3 -3 41 5 -1 -1 1 4 6 3 -6
10 -6 1 -5 1 6 -4 0 2 42 -6 1 -5 1 6 -5 -5 6
11 -5 1 -1 1 -4 3 1 -1 43 -4 1 1 -1 -5 2 1 -2
12 3 -1 -2 -1 -6 -2 4 0 44 2 -1 6 -1 6 4 -1 -6
13 -5 1 -2 1 -4 6 -1 3 45 3 -1 -3 1 -1 -6 -2 2
14 -5 1 -5 1 6 -6 4 3 46 -2 1 3 -1 4 -1 -2 3
15 -4 1 -3 1 -6 6 -4 0 47 6 -1 -3 1 -6 -5 -4 3
16 -6 1 1 -1 2 1 -1 -4 48 -4 1 -5 1 2 4 -4 0
17 -6 1 -5 1 -2 0 4 6 49 -5 1 1 1 -3 -2 3 1
18 5 -1 -4 -1 6 -5 6 -5 50 3 -1 6 -1 5 -6 -3 -6
19 -5 1 -6 1 -4 -1 3 6 51 -6 1 2 -1 6 -1 -6 2
20 3 -1 -2 -1 4 -1 -1 4 52 -4 1 4 -1 -1 -6 6 -4
21 2 -1 -6 1 -3 5 -1 -2 53 3 -1 4 -1 -1 -4 -5 2
22 6 -1 3 1 -3 -2 -3 -4 54 -5 1 1 -1 -4 -3 5 -3
23 -6 1 -3 -1 4 -2 -2 -2 55 -2 1 -3 1 -2 -1 6 -1
24 -6 1 -4 1 -1 5 -5 -2 56 -5 1 -3 1 1 4 -6 -2
25 3 -1 1 -1 -1 -2 4 -6 57 5 -1 0 1 -4 -3 -5 2
26 -6 1 2 -1 -3 6 -2 -6 58 2 -1 -5 1 5 -1 4 -6
27 -4 1 5 -1 3 -5 2 6 59 -3 1 1 -1 -4 -1 5 3
28 -7 1 -1 -1 2 -4 4 3 60 -3 1 -3 1 0 -6 4 1
29 3 -1 4 -1 -2 -6 -5 3 61 -5 1 -6 1 6 -2 -2 -6
30 2 -1 -5 1 1 -3 1 1 62 -4 1 -1 1 -4 6 -5 -1
31 4 -1 2 -1 3 4 1 1 63 6 -1 3 -1 5 5 5 3

Rule Rule
64 -7 4 -4 1 -6 -3 -2 3 96 1 -1 -2 1 -1 -1 -3 -3
65 3 -1 -1 -1 4 -6 6 4 97 3 -1 -2 1 -5 3 -5 -5
66 5 -1 3 1 0 6 -1 4 98 -4 1 3 -1 -1 1 6 -2
67 4 -1 1 -1 -1 -6 4 -3 99 -4 1 -1 1 -3 1 5 -3
68 1 -1 -2 1 -6 0 5 -3 100 3 -1 -5 1 -4 4 6 3
69 1 -1 -2 1 1 2 -2 -1 101 3 -1 6 -1 -1 2 -2 3
70 -4 1 5 -1 1 -5 -2 4 102 -6 1 0 -1 4 0 5 -6
71 2 -1 4 -1 4 5 -1 3 103 3 -1 3 -1 1 -4 5 5
72 3 -1 0 1 -6 2 6 2 104 2 -1 1 -1 5 -4 -6 -5
73 4 -1 1 1 -5 -5 6 -4 105 5 -1 -6 1 -3 3 3 -3
74 3 -1 1 -1 1 -2 -1 -5 106 -4 1 0 1 -1 3 3 -4
75 2 -1 -5 1 4 3 -4 -1 107 -7 1 -4 -1 5 -5 -4 5
76 2 -1 -5 1 2 -4 -6 -4 108 -5 1 0 -1 3 -2 4 -3
77 6 -1 -1 -1 5 2 -2 3 109 -4 1 1 -1 -6 4 -3 5
78 -4 1 -5 1 6 -5 2 3 110 4 -1 -4 1 1 -1 -5 -4
79 3 -1 -5 1 -4 -4 5 2 111 -2 1 2 -1 -6 6 -4 2
80 2 -1 0 -1 3 -5 1 -2 112 -3 1 -4 1 -6 -4 2 2
81 -4 1 5 -1 4 -1 -6 -3 113 5 -1 -1 -1 -4 1 -1 -1
82 3 -1 0 -1 1 -4 2 -3 114 3 -1 5 -1 4 -6 3 -2
83 4 -1 5 -1 -2 5 -6 3 115 -2 1 6 -1 -3 5 2 1
84 -4 1 -3 1 -4 -3 -1 6 116 3 -1 4 -1 5 -3 2 6
85 -2 1 6 -1 3 0 6 -4 117 -6 1 -2 -1 -5 1 -3 6
86 4 -1 -6 1 1 -5 1 4 118 -3 1 -5 1 -5 -5 4 3
87 4 -1 -6 1 -4 3 -6 -4 119 -3 1 0 1 3 1 -6 2
88 3 -1 1 -1 1 -6 -3 -5 120 -6 1 0 1 -3 -4 3 3
89 -3 1 6 -1 4 4 1 -3 121 -3 1 3 -1 -6 -2 6 5
90 -4 1 1 -1 0 -5 2 4 122 4 -1 3 -1 2 -5 -2 -3
91 -3 1 1 -1 -1 -3 2 5 123 -2 1 3 -1 -5 6 5 -4
92 3 -1 -5 1 -6 -3 1 -5 124 3 -1 -6 1 6 -4 -5 1
93 -4 1 -6 1 2 -6 6 1 125 -2 1 0 -1 3 4 -4 -2
94 6 -1 2 -1 1 5 3 6 126 4 -1 6 -1 -6 -2 -1 -2
95 6 -1 -5 1 6 5 -2 3 127 -1 1 -5 1 4 6 -3 -2

Rule Rule
128 -5 1 5 -1 -1 -3 -4 -3 160 -6 1 5 -1 4 5 -1 4
129 5 -1 0 -1 0 1 -6 1 161 -2 1 -3 1 1 4 3 4
130 4 -1 1 1 5 -4 2 -5 162 -4 1 -4 1 5 1 -3 6
131 3 -1 5 -1 5 3 3 -4 163 -3 1 -5 1 -6 4 5 -2
132 1 -1 2 -1 5 -3 -5 1 164 2 -1 6 -1 5 -2 -6 -4
133 -5 1 -2 1 -2 6 2 4 165 4 -1 -1 1 0 5 -3 -6
134 5 -1 3 1 6 6 -6 -5 166 -7 1 0 1 5 5 -2 6
135 -4 1 -2 1 -2 6 3 4 167 5 -1 -3 1 3 5 -1 -6
136 -6 1 -4 1 4 1 4 6 168 -6 1 -1 1 -5 -1 -1 -3
137 4 -1 -5 1 5 5 -3 -3 169 -5 1 1 -1 -4 -5 -2 -6
138 -6 1 -4 1 -6 2 -2 -6 170 -1 1 -4 1 -5 4 0 -5
139 3 -1 5 -1 2 6 -4 3 171 -7 1 -3 -1 4 3 2 6
140 -6 1 -3 1 6 -3 6 2 172 3 -1 -5 1 2 4 3 -6
141 -2 1 3 -1 2 -3 -1 -4 173 4 -1 4 -1 -2 -6 -4 5
142 3 -1 2 -1 -6 -2 4 4 174 -4 1 -6 1 -5 6 -6 4
143 -3 1 -1 -1 -5 4 -1 -1 175 -4 1 1 1 -1 -3 0 -6
144 -5 1 -6 1 -4 -4 -3 -5 176 -6 1 2 -1 -6 -4 3 -2
145 2 -1 3 -1 4 -4 6 -2 177 -3 1 -4 1 -3 2 5 6
146 5 -1 -1 -1 5 -2 4 -4 178 2 -1 -2 1 -4 2 -2 3
147 -3 1 1 1 -1 1 2 1 179 -2 1 -1 1 4 -2 -5 -1
148 5 -1 -1 -1 5 -4 -4 4 180 3 -1 -2 1 3 -4 -3 2
149 3 -1 6 -1 2 5 -2 3 181 4 -1 -2 1 2 -4 -2 3
150 -3 1 -6 1 4 -3 3 -4 182 -6 1 3 1 5 5 -6 5
151 -2 1 0 1 -4 4 3 4 183 -2 1 6 -1 -5 3 4 -3
152 3 -1 0 1 -2 2 5 -3 184 -3 1 4 -1 -4 -3 -2 -5
153 4 -1 0 1 1 1 -5 5 185 -2 1 2 -1 1 3 4 5
154 5 -1 0 1 -2 2 -1 5 186 4 -1 -3 1 6 -5 1 -6
155 4 -1 -6 1 -3 -6 4 -4 187 5 -1 -6 1 -3 0 -1 -4
156 -5 1 0 -1 3 -2 5 2 188 5 -1 4 -1 2 -5 -6 1
157 -4 1 0 1 -3 2 4 6 189 4 -1 -2 1 -1 -4 -3 3
158 -6 1 0 -1 -4 6 -4 -6 190 -1 1 3 -1 2 -6 6 5
159 -6 1 4 1 6 -6 -2 -1 191 -7 1 -6 -1 -2 3 3 4

Rule Rule
192 -7 1 -2 1 4 6 3 0 224 -4 1 -5 1 4 2 5 -1
193 -6 1 -5 1 -4 -6 -6 -4 225 -6 1 -1 1 2 6 5 5
194 -4 1 -4 1 -2 -6 -5 4 226 -3 1 5 -1 5 3 -1 6
195 6 -1 2 1 2 -6 5 0 227 5 -1 1 -1 -2 3 -5 -1
196 4 -1 5 -1 -4 6 -4 -6 228 3 -1 -5 1 6 -4 -2 3
197 3 -1 -5 1 -6 4 2 -5 229 4 -1 3 -1 -4 6 -2 -6
198 -4 1 -3 1 4 5 6 -3 230 3 -1 -2 1 -2 -1 4 3
199 5 -1 1 -1 2 3 -4 -2 231 6 -1 -3 1 -1 -3 6 4
200 -4 1 3 -1 5 2 4 2 232 -2 1 3 -1 2 1 1 4
201 3 -1 -5 1 6 2 -3 2 233 -4 1 -3 1 -6 -3 -6 -5
202 -3 1 -4 1 3 -6 -2 5 234 -5 1 3 1 -5 -1 -1 -4
203 5 -1 -4 1 3 6 -5 4 235 -5 1 -1 -1 -6 1 4 -6
204 3 -1 2 -1 4 2 -5 1 236 -7 1 3 1 4 -2 5 -2
205 -2 1 -3 1 -2 -4 -6 -4 237 -3 1 1 1 -5 3 -4 3
206 -3 1 -5 1 -3 6 3 -5 238 5 -1 2 -1 4 -1 -5 -4
207 -2 1 -1 1 2 -5 -3 0 239 -1 1 0 1 2 -4 1 -3
208 -6 1 2 -1 6 5 2 -4 240 2 -1 6 -1 -2 2 6 1
209 2 -1 -4 1 -5 1 3 -4 241 -2 1 4 -1 -5 -6 3 -1
210 3 -1 -2 1 -2 5 -2 1 242 6 -1 3 -1 5 -5 4 -4
211 3 -1 -5 1 6 -4 4 1 243 4 -1 -3 1 3 -4 3 1
212 5 -1 2 -1 -6 3 3 -4 244 6 -1 1 -1 5 -6 -4 1
213 4 -1 3 -1 -5 2 4 -5 245 -4 1 3 1 1 5 0 4
214 -2 1 6 -1 4 5 -2 -4 246 -7 1 -3 -1 3 3 -6 5
215 -7 1 -4 -1 1 -4 -4 -3 247 6 -1 5 -1 5 -3 5 3
216 -3 1 4 -1 1 -3 6 4 248 -5 1 -2 -1 4 5 -2 -1
217 -2 1 -2 1 -3 -1 -6 -5 249 -5 1 -2 -1 -5 -5 3 1
218 -4 1 -1 1 -1 -6 -3 4 250 5 -1 -5 1 -5 4 -2 6
219 -7 1 -5 -1 0 -2 -6 -4 251 -2 1 1 1 -2 4 5 -1
220 -4 1 -1 -1 5 2 4 -1 252 4 -1 5 -1 -1 -3 2 0
221 4 -1 -4 1 4 0 -1 4 253 -2 1 -1 1 -1 -5 1 -1
222 -2 1 -4 1 5 -2 5 -1 254 -2 1 5 -1 -1 1 -4 6
223 -4 1 -2 -1 -3 -2 2 6 255 -3 1 3 1 -3 -4 5 -3
Table 5. Discrete time evolution of 1D cellular automata in Fig. 1 via a nonlinear difference equation for local rules
N = 0, 1, 2, . . . , 255.
Rule 0 : ț =1 Rule : ț =1
Difference Equation Difference Equation
[
uit +1 = sgn 0 ⋅ uit−1 + 0 ⋅ uit + 0 ⋅ uit+1 − 1 ] [
u it +1 = sgn − u it−1 − u it − u it+1 − 2 ]
Firing Patterns
2 3
vertex
n uit−1 u it u it+ 1 uit +1 Firing Patterns
2 3
vertex
n uit−1 u it u it+ 1 uit +1
6 7 6 7
0
0 -1 -1 -1 -1
0 -1 -1 -1 1
0 red pixel : 0 red pixel : 0
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
red pixel : red pixel :
3 -1 1 1 -1 3 -1 1 1 -1
2 red pixels : 4 1 -1 -1 -1 2 red pixels : 4 1 -1 -1 -1
5 1 -1 1 -1 5 1 -1 1 -1
3 red pixels : 6 1 1 -1 -1 3 red pixels : 6 1 1 -1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 2 : ț =1 Rule 3 : ț =1
[
u it +1 = sgn [ − uit−1 − u it + u it+1 − 2 ] [
u it +1 = sgn − u it−1 − u it − 1 ]
Firing Patterns
2 3
vertex
n uit−1 u it u it+1 uit +1 Firing Patterns
2 3
vertex
n uit−1 u it u it+1 uit +1
6 7 0 -1 -1 -1 -1 6 7
0 0
0 -1 -1 -1 1
0 red pixel : 0 red pixel :
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1

=
=
'LIIHUHQFH(TXDWLRQ 'LIIHUHQFH(TXDWLRQ

+ = −− + − + −
+ = − − − + −

)LULQJ3DWWHUQV

Q − + + )LULQJ3DWWHUQV

Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = − _ − − − + + _
+ = −− − − + −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV


=
=

+ = −− + + + −
+ = − _ − + − + + _

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = −− + + −
+ = −− − + + −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV


=
=

+ = −− + −
+ = −− + − + −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = −− + + + − + = −−

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

Rule 6 : ț =1 Rule 7 : ț =1
[
uit +1 = sgn uit−1 − uit − uit+1 − 2 ] ]u t +1
i [
= sgn −uit − uit+1 − 1 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 1
2 red pixels : 4 1 -1 -1 1 2 red pixels : 4 1 -1 -1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 8 : ț=2 Rule 9 : ț =1

[
uit +1 = sgn 1− | uit−1 + 2uit + uit+1 + 2 | ]]
u = sgn [−ut +1
i
t
i −1 − 2uit − uit+1 − 1 ]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
2 red pixels : 4 1 -1 -1 1 2 red pixels : 4 1 -1 -1 1
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 20 : ț=2 Rule 2 : ț =1

[
uit +1 = sgn 1− | −2uit−1 − 2uit + uit+1 + 1 | ] ]u t +1
i [
= sgn −uit−1 − uit − 2uit+1 − 1 ]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 22 : ț=2 Rule 23 : ț =1

[
uit +1 = sgn 1− | uit−1 + uit + uit+1 + 1 | ] ]u t +1
i [
= sgn −uit−1 − uit − uit+1 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 6 7
0
0 -1 -1 -1 -1 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 24 : ț=2 Rule 25 : ț=2

[
uit +1 = sgn −2+ | uit−1 − uit − uit+1 | ] ]u t +1
i [
= sgn 3− | uit−1 − 2uit + 4uit+1 + 1| ]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 26 : ț=2 Rule 27 : ț =3

[
uit +1 = sgn 3− | 2uit−1 − uit + 4uit+1 −1| ]] [ |
uit +1 = sgn 2− (−3+ | −2uit−1 − 4uit + uit+1 − 3| ) |]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 6 7
0
0 -1 -1 -1 -1 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 28 : ț=2 Rule 29 : ț =3

[
uit +1 = sgn 3− | 2uit−1 + 4uit − uit+1 − 1 | ] ]u = sgn[2− |(3− | −2u
t +1
i
t
i −1 + uit − 4uit+1 − 3 | ) |]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 30 : ț=2 Rule 3 : ț =1

[
uit +1 = sgn 2− | −2uit−1 − uit − uit+1 −1| ] ]u t +1
i [
= sgn −3uit−1 − uit − uit+1 + 2 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1

=
=

+ = − − + + −
+ = − _ −− + + + + _

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = − + + −
+ = −− − + + −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

Rule 36 : ț=2 Rule 37 : ț=2

[
uit +1 = sgn −2+ | uit−1 − uit + uit+1 | ]] [
uit +1 = sgn 3− | 2uit−1 − uit − 4uit+1 − 1 | ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 38 :
ț=2 Rule 39 : ț =3
[
uit +1 = sgn 3− | −uit−1 + 2uit + 4uit+1 − 1 | ] u]= sgn[2− |(−3+ | −4u
t +1
i
t
i −1 − 2uit + uit+1 − 3 | ) |]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 40 : ț=2 Rule 4 : ț=2

[
uit +1 = sgn 1− | −2uit−1 − 2uit + uit+1 − 1 | ] ]u t +1
i [
= sgn 1− | − u it−1 − u it + u it+1 − 1 | ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 42 : ț =1 Rule 43 : ț =1
[
uit +1 = sgn −uit−1 − uit + 2uit+1 − 1 ]] [
uit +1 = sgn −uit−1 − uit + uit+1 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 6 7
0
0 -1 -1 -1 -1 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 44 : ț=2 Rule 45 : ț=2

[
uit +1 = sgn 3− | −4uit−1 − 2uit + uit+1 − 1 | ] u]= sgn [2− | −2u
t +1
i
t
i −1 − uit + uit+1 − 1 | ]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 46 : ț =3 Rule 47 : ț =1
[ |
uit +1 = sgn 2− (3− | uit−1 − 2uit − 3uit+1 + 4 |) |] ]u t +1
i [
= sgn − 3u it−1 − u it + u it+1 + 2 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1

=
=

+ = − − −
+ = − − − + −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = − − + + − + = −

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV


=
=

+ = − _ −− − − + − _ _
+ = − −+ _ − + − + − _ _

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

=
=

+ = − _ −− − − + − _
+ = −− − − + +

)LULQJ3DWWHUQV


Q − + +

UHGSL[HO
UHGSL[HO

UHGSL[HO UHGSL[HO

UHGSL[HOV UHGSL[HOV

UHGSL[HOV UHGSL[HOV

Rule 56 : ț=2 Rule 57 : ț=2

[
uit +1 = sgn 3− | 2uit−1 + 4uit − uit+1 + 1 | ] ]u t +1
i [
= sgn 2 − | −uit−1 − 2uit + uit+1 − 1 | ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 58 : ț =3 Rule 59 : ț =1
[ |
uit +1 = sgn 2− (3− | −uit−1 + 2uit − 4uit+1 + 3 | ) |] ]u t +1
i [
= sgn −uit−1 − 3uit + uit+1 + 2 ]]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 6 7
0
0 -1 -1 -1 -1 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 60 : ț=2 Rule 6 : ț=2

[
u it +1 = sgn 1− | u it−1 + u it |] ] [
u it +1 = sgn 3 − | − 2u it−1 − 2u it + u it+1 − 1 | ]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 0 -1 -1 -1 -1 6 7
0
0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 62 :
ț=2 Rule 63 : ț =1
[
u it +1 = sgn 3 − | − 2u it−1 − 2u it − u it+1 − 1 | ]] [
u it +1 = sgn − u it + 1 ][]
Firing Patterns
2 3
vertex
2 3
vertex
6 7 6 7
0
0 -1 -1 -1 -1 0
0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 64 : ț =1 Rule 65 : ț=2

[
uit +1 = sgn uit−1 + uit − uit+1 − 2 ][] [
uit +1 = sgn 1− | 2uit−1 − 2uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
3 red pixels : 6 1 1 -1 1 3 red pixels : 6 1 1 -1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 66 :
ț=2 Rule 67 :
ț=2
[
uit +1 = sgn −2+ | −uit−1 − uit + uit+1 | ][] [
uit +1 = sgn 3− | 2uit−1 − 4uit − uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 68 : ț =1 Rule 69 : ț =1
[
u it +1 = sgn u it − u it+1 − 1 ][] [
u it +1 = sgn − u it−1 + u it − 2 u it+1 − 1 ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 70 : ț=2 Rule 7 : ț =3

[
uit +1 = sgn 3− | −uit−1 + 4uit + 2uit+1 − 1 | ][]u = sgn[2− |(3− | −4u
t +1
i
t
i −1 + uit − 2uit+1 − 3 | ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 72 : ț=2 Rule 73 : ț=2

[
u it +1 = sgn 1− | − 2 u it−1 + u it − 2 u it+1 − 1 | ][]
u t +1
i [
= sgn 1− | u it−1 − u it + u it+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 74 : ț=2 Rule 75 : ț=2

[
u it +1 = sgn 3 − | 2 u it−1 + u it + 4 u it+1 − 1 | ][]
u = sgn [ 2 − | (2u
t +1
i
t
i −1 − u it + u it+1 + 1) | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 76 : ț =1 Rule 77 : ț =1
[
u it +1 = sgn − u it−1 + 2 u it − u it+1 − 1 ][]u t +1
i [
= sgn − u it−1 + u it − u it+1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule78 : ț =3 Rule 79 : ț =1
uit +1 = sgn 2− [ | (−3+ | 3u t

i −1 − uit + 2uit+1 + 4 | ) |][]u i
t +1
[
= sgn − 3u it−1 + u it − u it+1 + 2 ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 80 : ț =1 Rule 8 : ț =1
[
uit +1 = sgn uit−1 − uit+1 − 1 ][] [
uit +1 = sgn uit−1 − uit − 2uit+1 − 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 82 : ț=2 Rule 83 : ț =3

[
uit +1 = sgn 3− | −2uit−1 − uit − 4uit+1 − 1 | ][] [ |
uit +1 = sgn 2− (3− | −3uit−1 + 4uit − 2uit+1 + 1| ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 84 : ț =1 Rule 85 : ț =1
[
uit +1 = sgn uit−1 + uit − 2uit+1 − 1 ][] uit +1 = sgn −uit+1 [ ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 86 : ț=2 Rule 87 : ț =1

[
uit +1 = sgn 2− | −uit−1 − uit − 2uit+1 − 1 | ][] [
uit +1 = sgn −uit−1 − uit − 3uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 88 : ț=2 Rule 89 : ț=2

[
uit +1 = sgn 3− | −4uit−1 − uit − 2uit+1 + 1 | ][] u t +1
i [
= sgn 2− | uit−1 − uit + 2uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 90 : ț=2 Rule 9 : ț=2

[
uit +1 = sgn 1− | uit−1 + uit+1 | ][] [
uit +1 = sgn 3− | −2uit−1 + uit − 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 92 : ț =3 Rule 93 : ț =1
uit +1 = sgn 2− [ | (3− | u t

i −1 − 2uit + 4uit+1 + 3 | ) |][]u t +1
i [
= sgn − uit−1 + uit − 3uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 94 : ț=2 Rule 95 : ț =1

[
uit +1 = sgn 3− | −2uit−1 − uit − 2uit+1 − 1 | ][]u t +1
i [
= sgn − uit−1 − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 1 1 1 -1 7 1 1 1 -1
Rule 96 : ț=2 Rule 97 : ț=2

[
uit +1 = sgn 1− | −2uit−1 + uit + uit+1 + 2 | ][] u t +1
i [
= sgn 1− | −uit−1 + uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 98 :
ț=2 Rule 99 : ț=2
[
uit +1 = sgn 3− | −uit−1 − 2uit − 4uit+1 + 1 | ][]u t +1
i [
= sgn 2 − | −uit−1 + 2uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 00 : ț=2 Rule 0 : ț=2

[
uit +1 = sgn 3− | −uit−1 − 4uit − 2uit+1 + 1 | ][]u t +1
i [
= sgn 2 − | 2uit−1 − uit − 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 02 :
ț=2 Rule 03 : ț=2
[
uit +1 = sgn 1− | uit + uit+1 | ][] [
uit +1 = sgn 3− | −uit−1 + 2uit + 2uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 04 : ț=2 Rule 05 : ț =3

[
uit +1 = sgn 1− | −uit−1 − uit − uit+1 + 1 | ][]u t +1
i [ |
= sgn 1− (2− | −uit−1 + uit − uit+1 + 1| ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 06 : ț=2 Rule 07 : ț=2

[
uit +1 = sgn 2 − | uit−1 + uit + 2uit+1 − 1 | ][]u t +1
i [
= sgn −1+ | −uit−1 − uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 08 : ț=2 Rule 09 : ț=2

[
uit +1 = sgn 2− | −uit−1 − 2uit − uit+1 + 1 | ][] u t +1
i [
= sgn −1+ | −uit−1 + uit − uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 0 : ț=2 Rule : ț=2

[
uit +1 = sgn −2+ | uit−1 + 2uit − 3uit+1 − 1 | ][] u t +1
i [
= sgn −1+ | uit−1 − 2uit + 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 2 : ț =1 Rule 3 : ț =1

[
u it +1 = sgn 2u it−1 − u it − u it+1 − 1 ][] [
uit +1 = sgn uit−1 − uit − uit+1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
ț =3 ț =1
Rule 4 : Rule 5 :
[ |
uit +1 = sgn 2− (3− | −4uit−1 + 2uit − uit+1 + 3 | ) |][] [
uit +1 = sgn uit−1 − 3uit − uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 6 : ț =3 Rule 7 : ț =3

[ |
uit +1 = sgn 2− (3− | −4uit−1 − uit + 2uit+1 + 3 | ) |][] u t +1
i [
= sgn uit−1 − uit − 3uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 8 : ț=2 Rule 9 : ț =1

[
uit +1 = sgn 3− | −uit−1 − 2uit − 2uit+1 − 1 | ][] u t +1
i [
= sgn −uit − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 20 : ț=2 Rule 2 : ț=2

[
uit +1 = sgn 2− | 2uit−1 + uit + uit+1 − 1 | ][]u t +1
i [
= sgn −1+ | −uit−1 + uit + uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 22 : ț=2 Rule 23 : ț=2

[
uit +1 = sgn 3− | −2uit−1 − uit − 2uit+1 + 1 | ][]u t +1
i [
= sgn −1+ | 2uit−1 + uit − 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 24 : ț=2 Rule 25 : ț=2

[
uit +1 = sgn 3− | 2uit−1 + 2uit + uit+1 − 1 | ][]u t +1
i [
= sgn −1+ | −uit−1 + uit + 2uit+1 − 2 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 26 :
ț=2 Rule 27 :
ț =1
[
uit +1 = sgn 2− | −uit−1 − uit − uit+1 | ][] [
uit +1 = sgn −uit−1 − uit − uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 1 1 1 -1 7 1 1 1 -1
Rule 28 : ț =1 Rule 29 : ț=2

[
uit +1 = sgn uit−1 + uit + uit+1 − 2 ][] [
uit +1 = sgn −2+ | uit−1 + uit + uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 30 :
ț=2 Rule 3 :
ț=2
[
uit +1 = sgn 1− | −uit−1 + uit − 2uit+1 + 2 | ][]u t +1
i [
= sgn 3− | 4uit−1 − 2uit − uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 32 : ț=2 Rule 33 : ț=2

[
uit +1 = sgn 1− | 2uit−1 − uit − 2uit+1 + 1 | ][]u t +1
i [
= sgn 3− | −2uit−1 − uit + 4uit+1 + 1 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 34 :
ț=2 Rule 35 :
ț=2
[
uit +1 = sgn 1− | uit−1 − uit − uit+1 + 1 | ][] u t +1
i [
= sgn 2− | 2uit−1 − uit − uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 36 : ț =1 Rule 37 : ț=2

[
uit +1 = sgn uit + uit+1 − 1 ][] [
uit +1 = sgn 3− | −uit−1 − 2uit + 4uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 38 : ț =1 Rule39 : ț =3

[
uit +1 = sgn −uit−1 + uit + 2uit+1 − 1 ][] u t +1
i [ |
= sgn 2− (−3+ | −uit−1 − 2uit + 3uit+1 − 4 | ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 40 : ț =1 Rule 4 : ț =3

[
uit +1 = sgn − uit−1 + 2uit + uit+1 − 1 ][]u = sgn[2− | (3− | −2u
t +1
i
t
i −1 − 4uit + 3uit+1 + 1| ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule42 : ț =1 Rule 43 : ț =1

[
u it +1 = sgn − u it−1 + u it + u it+1 ][] u t +1
i [
= sgn − 3u it−1 + u it + u it+1 + 2 ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 44 : ț=2 Rule 45 : ț=2

[
uit +1 = sgn 1− | −2uit−1 + uit − uit+1 + 2 | ][]u t +1
i [
= sgn 3− | −uit−1 − 2uit + 4uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 46 :
ț=2 Rule 47 :
ț=2
[
uit +1 = sgn 1− | uit−1 − uit + uit+1 − 1 | ][] [
uit +1 = sgn 2− | uit−1 − 2uit + uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 48 : ț=2 Rule 49 : ț=2

[
uit +1 = sgn 1− | −uit−1 − uit + uit+1 + 1 | ][] u t +1
i [
= sgn 2− | −uit−1 − uit + 2uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 50 :
ț =3 Rule 5 :
ț=2
[ |
uit+1 = sgn 3− (7− | −4uit−1 − 2uit + 4uit+1 − 3| ) |][]u t +1
i [
= sgn −1+ | −uit−1 − uit − uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 52 : ț=2 Rule 53 : ț=2

[
uit +1 = sgn 3− | uit−1 + 4uit − 2uit+1 − 1 | ][] [
uit +1 = sgn 1− | −uit + uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 54 :
ț=2 Rule55 :
ț=2
[
uit +1 = sgn 2− | uit−1 − uit + 2uit+1 − 1 | ][]u t +1
i [
= sgn 3− | −uit−1 + 2uit − 2uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 56 : ț=2 Rule 57 : ț=2

[
uit +1 = sgn 2 − | uit−1 + 2uit − uit+1 − 1 | ][]u t +1
i [
= sgn 3− | uit−1 + 2uit − 2uit+1 − 1 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 58 :
ț=2 Rule 59 :
ț=2
[
uit +1 = sgn − 1+ | uit−1 − uit − uit+1 − 1 | ][]
u t +1
i [
= sgn −1+ | −2uit−1 + uit + uit+1 + 2 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 3
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 60 : ț =1 Rule 6 : ț=2

[
uit +1 = sgn uit−1 + uit+1 − 1 ][] [
uit +1 = sgn 3− | 2uit−1 + uit − 4uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 62 : ț =1 Rule 63 : ț =3

[
uit +1 = sgn uit−1 − uit + 2uit+1 − 1 ][] [ |
uit +1 = sgn 2− (3− | 3uit−1 − 4uit − 2uit+1 −1| ) |][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 64 : ț=2 Rule 65 : ț=2

[
uit +1 = sgn −3+ | −2uit−1 + uit − 2uit+1 − 1 | ][] [
uit +1 = sgn 1− | −uit−1 + uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 66 :
ț=2 Rule 67 : ț=2
[
uit +1 = sgn 2− | uit−1 − uit − 2uit+1 + 1 | ][] u t +1
i [
= sgn 3− | −2uit−1 + uit + 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 68 : ț =1 Rule 69 : ț=2

[
uit +1 = sgn uit−1 + uit + 2uit+1 − 1 ][] [
uit +1 = sgn 2− | uit−1 + uit − 2uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 70 : ț =1 Rule 7 : ț =1

uit +1 = sgn uit+1 [ ][] [

uit +1 = sgn −uit−1 − uit + 2uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 72 : ț =3 Rule 73 : ț=2

[ |
uit +1 = sgn 2− (3− | −3uit−1 − 4uit + 2uit+1 +1| ) |][]u t +1
i [
= sgn 3− | −2uit−1 − uit + 2uit+1 − 1 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 74 : ț =1 Rule 75 : ț =1

[
uit +1 = sgn −uit−1 + uit + 2uit+1 + 1 ][] [
uit +1 = sgn −uit−1 + uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 76 : ț =1 Rule 77 : ț =3

[
uit +1 = sgn 2uit−1 − uit + uit+1 − 1 ][]u t +1
i = sgn 2−[ | (−3+ | 4u t
i −1 − 2uit − uit+1 − 3 | ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 78 : ț =1 Rule 79 : ț =1

[
uit +1 = sgn uit−1 − uit + uit+1 ][] [
uit +1 = sgn uit−1 − 3uit + uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 80 : ț=2 Rule 8 : ț=2

[ ][]
uit +1 = sgn 2− | −2uit−1 − uit + uit+1 + 1 | uit +1 = sgn 3− | 2uit−1 + uit − 2uit+1 − 1 | [ ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 82 : ț=2 Rule 83 : ț=2

[
uit +1 = sgn − 1+ | −uit−1 + uit − uit+1 − 1 | u = sgn [−1+ | u
][] t +1
i
t
i −1 − 2uit + uit+1 + 2 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 84 : ț =3 Rule 85 : ț=2

uit +1 = sgn 2− [ | (−3+ | u t

i −1 − 2uit + 3uit+1 − 4 | ) |][]uit +1 = sgn [3− | −uit−1 − 2uit + 2uit+1 − 1 |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 86 : ț =1 Rule 87 : ț =1

[
uit +1 = sgn uit−1 − uit + 2uit+1 + 1 ][] [
uit +1 = sgn −uit + uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 88 : ț=2 Rule 89 : ț=2

[
uit +1 = sgn 3− | 2uit−1 + 2uit − uit+1 − 1 | ][] [
uit +1 = sgn 2− | uit−1 + uit − uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 90 :
ț=2 Rule 9 :
ț =1
[
uit +1 = sgn − 1+ | −2uit−1 + 2uit + uit+1 + 1 | ][] u t +1
i [
= sgn −uit−1 − uit + uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 3 5
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 92 : ț =1 Rule 93 : ț=2

[
uit +1 = sgn uit−1 + uit −1 ][] [
uit +1 = sgn 3− | 4uit−1 − 2uit − uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 94 :
ț=2 Rule 95 :
ț=2
[
uit +1 = sgn 3− | −2uit−1 + 4uit + uit+1 −1| ][] [
uit +1 = sgn 1− | −uit−1 + uit | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 96 : ț =1 Rule 97 : ț =3

[
uit +1 = sgn uit−1 + 2uit − uit+1 − 1 ][] u t +1
i [ | (3− | −3u
= sgn 2− t
i −1 + 4uit + 2uit+1 − 1 | ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 98 : ț=2 Rule 99 : ț=2

[
uit +1 = sgn 2− | uit−1 − 2uit − uit+1 + 1 | ][] u t +1
i [
= sgn 3− | 2uit−1 − 2uit − uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 200 : ț =1 Rule 20 : ț=2

[
uit +1 = sgn uit−1 + 2uit + uit+1 − 1 ][] [
uit +1 = sgn 2− | uit−1 − 2uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 202 :
ț =3 Rule 203 : ț=2
uit +1 = sgn 2− [ | (3− | 3u t

i −1 − 4uit + 2uit+1 + 1 | ) |][]uit +1 = sgn [3− | −2uit−1 + 2uit − uit+1 − 1 |][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 204 : ț =1 Rule 205 : ț =1

u it +1 = sgn u it [ ][] [
uit +1 = sgn −uit−1 + 2uit − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 206 : ț =1 Rule 207 : ț =1

[
uit +1 = sgn − uit−1 + 2uit + uit+1 + 1 ][] [
uit +1 = sgn −uit−1 + uit + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 208 : ț =1 Rule 209 : ț =3

[
uit +1 = sgn 2uit−1 + uit − uit+1 − 1 ][] uit +1 = sgn 2− [ | (3− | 2u t
i −1 + uit − 4uit+1 − 3 | ) |][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 20 : ț=2 Rule 2 : ț=2

[
uit +1 = sgn 2− | −2uit−1 + uit − uit+1 + 1 | u = sgn [3− | −2u
][] t +1
i
t
i −1 + 2uit − uit+1 + 1 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 22 : ț =1 Rule 23 : ț =1

[
uit +1 = sgn uit−1 + uit − uit+1 ][] [
uit +1 = sgn uit−1 + uit − 3uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 24 : ț=2 Rule 25 : ț=2

[
uit +1 = sgn − 1+ | uit−1 + uit − uit+1 + 1 | ][]u t +1
i [
= sgn −1+ | 2uit−1 + 2uit + uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
6 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 26 : ț =3 Rule 27 : ț=2

[ |
uit +1 = sgn 2− (−3+ | −3uit−1 + uit − 4uit+1 + 2 | ) |][]
u t +1
i [
= sgn 3− | −uit−1 + 2uit − 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 28 : ț=2 Rule 29 : ț=2

[
uit +1 = sgn 3− | 2uit−1 − xit + 2uit+1 − 1 | ][] u t +1
i [
= sgn 2− | −uit−1 + uit − uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 220 : ț =1 Rule 22 : ț =1

[
uit +1 = sgn uit−1 + 2uit − uit+1 + 1 ][] [
uit +1 = sgn uit − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 222 : ț=2 Rule 223 : ț =1

[
uit +1 = sgn − 1+ | −uit−1 − 2uit + uit+1 − 2 | ][] u t +1
i [
= sgn −uit−1 + uit − uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 6 3 6
5 1 -1 1 -1 5 1 -1 1 -1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 224 : ț =1 Rule 225 : ț=2

[
uit +1 = sgn 2uit−1 + uit + uit+1 − 1 ][] [
uit +1 = sgn 2 − | − 2uit−1 + uit + uit+1 + 1 | ][
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 226 :
ț =3 Rule 227 : ț=2
[ | ( 3− | − 2u
uit +1 = sgn 2 − t
i −1 − uit − 4uit+1 + 3 | ) |][]uit +1 = sgn [3− | 2uit−1 − 2uit − uit+1 − 1 |][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 -1 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 228 : ț =3 Rule 229 : ț=2

uit +1 = sgn 2− [ | (3− | 2u t

i −1 + 4uit + uit+1 − 3 | ) |][]uit +1 = sgn [3− | −2uit−1 + uit + 2uit+1 + 1 |][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 230 :
ț=2 Rule 23 : ț=2
[
uit +1 = sgn 3− | −uit−1 + 2uit + 2uit+1 − 1 | ][] u t +1
i [
= sgn 2− | uit−1 − uit − uit+1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 -1 2 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 232 : ț =1 Rule 233 : ț=2

[
uit +1 = sgn uit−1 + uit + uit+1 ][] [
uit +1 = sgn −1+ | uit−1 + uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 234 : ț =1 Rule 235 : ț=2

[
uit +1 = sgn uit−1 + uit + 2uit+1 + 1 ][] u t +1
i [
= sgn −1+ | 2uit−1 + 2uit + uit+1 + 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
3 -1 1 1 1 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 236 : ț =1 Rule 237 : ț=2

[
uit +1 = sgn uit−1 + 2uit + uit+1 + 1 ][] [
uit +1 = sgn −1+ | 2uit−1 − uit + 2uit+1 − 1 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 238 : ț =1 Rule 239 : ț =1

[
uit +1 = sgn uit + uit+1 + 1 ][] [
uit +1 = sgn −uit−1 + uit + uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 3 -1 1 1 1 2 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 240 : ț =1 Rule 24 : ț =1

uit +1 = sgn uit−1 [ ][] [

uit +1 = sgn 2uit−1 − uit − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 242 : ț =1 Rule 243 : ț =1

[
uit +1 = sgn 2uit−1 − uit + uit+1 + 1 ][] [
uit +1 = sgn uit−1 − uit + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 -1 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 244 : ț =1 Rule 245 : ț =1

[
uit +1 = sgn 2uit−1 + uit − uit+1 + 1 ][] [
uit +1 = sgn uit−1 − uit+1 + 1 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 246 : ț=2 Rule 247 : ț =1

[
uit +1 = sgn −1+ | −uit−1 + 2uit − 2uit+1 − 1 | ][] [
uit +1 = sgn uit−1 − uit − uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 -1 2 4 3 -1 1 1 -1
5 6 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 248 : ț =1 Rule 249 : ț=2

[
u it +1 = sgn 2u it−1 + u it + u it+1 + 1 ][]u t +1
i [
= sgn −1+ | 2uit−1 − uit − uit+1 + 2 | ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 250 : ț =1 Rule 25 : ț =1

[
u it +1 = sgn u it−1 + u it+1 + 1 ][] [
uit +1 = sgn uit−1 − uit + uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 -1 2 -1 1 -1 -1
4 3 -1 1 1 1 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 252 : ț =1 Rule 253 : ț =1

[
uit +1 = sgn uit−1 + uit + 1 ][] [
uit +1 = sgn uit−1 + uit − uit+1 + 2 ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6 7

0 -1 -1 -1 1
-1 -1 1 -1 0 -1 -1 1 -1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
Rule 254 : ț =1 Rule 255 :

ț =1
[
uit +1 = sgn uit−1 + uit + uit+1 + 2 ][] uit +1 = sgn 1 [ ][]
vertex
Firing Patterns
2 3
2 3
vertex
6
0
7

0 -1 -1 -1 -1 6
0
7

0 -1 -1 -1 1
-1 -1 1 1 0 -1 -1 1 1
4 5 4 5
2 -1 1 -1 1 2 -1 1 -1 1
2 4 3 -1 1 1 1 2 4 3 -1 1 1 1
3 5 6 3 5 6
5 1 -1 1 1 5 1 -1 1 1
7 7
7 1 1 1 1 7 1 1 1 1
(κ = 1, 2, or 3) defined in [Chua et al., 2002] is we have to resort to the two-nested universal

printed in the upper right-hand corner. CA map F defined in Eq. (7). Observe that
2. Top upper-half portion: Explicit equation used to Eq. (7) can also be used to generate any lo-
generate the sample pattern given in the lower- cal rule of complexity index κ = 1, or κ =
half portion. 2. However, in this case all eight parameters
3. Middle-half portion: The firing patterns associ- {z2 , c2 , z1 , c1 , z0 , b1 , b2 , b3 } are needed in general.
ated with the red vertices of the Boolean cube
are given on the left. Each pattern is identified Finally we remark that the synaptic weights
below by the red vertex number it is associated chosen in this table are different from those given
with. The truth table encoded by the Boolean in Table 4. The reason is that for all local rules
cube is shown on the right. with a complexity index κ ≤ 2, the theory pre-
4. Lower-half portion: The first 30 iterations from sented in [Chua et al., 2002] shows that either one or
the same “red center-pixel” initial pattern used no absolute value function is needed in the discrete
in [Wolfram, 2002]. The array size is 30 × 61. map. In this case, we have opted for the simpler
discrete map (9) or (10). Even for those local rules
The nonlinear expression on the right-hand side requiring two absolute-value functions, we have
of the difference equation given in Table 5 for each chosen a different set of parameters (extracted from
of the 256 local rules assume one of the following Table 2 of [Chua et al., 2002]) to emphasize our as-
three forms of increasing complexity: sertion that many synaptic weights can be chosen
1. Complexity index κ = 1. This case pertains to to realize a local rule.
all 104 Boolean cubes in Table 1 with a red
ID number. In this case, all red vertices of the 4. Genealogic Classification of Local
cube can be separated from the blue vertices Rules
(linearly separable) by a single plane. Hence no
The patterns shown in Table 5 are all generated
absolute-value function is needed and we can
from a “single red center-pixel” initial pattern,
simply redefine
i.e. for the 1D CNN ring shown in Fig. 1, only cell
F(uti−1, uti, uti+1) “0” is red (which codes for 1) at t = 0. All other

cells are blue (which codes for −1) at t = 0. A total
= sgn z0 + b1uti−1 + b2uti + b3 uti+1 of 29 generations (i.e. iterations) of evolved patterns
(9) are shown for each local rule for a ring of N = 61
cells. Exactly the same initial and evolved patterns
In this case, only four parameters {z0 , b1 , b2 , b3 } are given in [Wolfram, 2002].
are needed. A cursory glance of the 256 patterns (30 rows ×
2. Complexity index κ = 2. This case includes all 61 columns) in Tables 5 reveals many duplications
Boolean cubes whose red vertices can be sep- and qualitatively similar dynamics. Our goal in this
arated from the blue vertices by two parallel section is to discover a unifying principle which will
planes. In this case, only one absolute-value func- allow us to reshuffle the 256 local rules into 16 dis-
tion is needed, and we must redefine tinct families, henceforth called CA gene families,
F(uti−1, uti, uti+1) which have different primary firing patterns to be

= sgn z1 + c1 z0 + b1 uti−1 + b2 uti
defined below. Each family has 16 members, hence-
forth called CA gene siblings, all sharing the same

+ b3 u t i+1
(10) primary firing patterns, but every member is char-
acterized by a distinct secondary firing pattern to be
We remark that Eq. (10) can also be used defined below. We will show that all gene siblings
to generate any local rule of complexity index belonging to the same family exhibit some common
κ = 1. However, in this case, six parameters qualitative properties.
{z1 , c1 , z0 , b1 , b2 , b3 } are needed in general.
3. Complexity index κ = 3. This is the most com-
4.1. Primary and secondary firing
plicated case where three parallel planes are
necessary to separate all red vertices from the patterns
blue vertices of the Boolean cube. Two absolute- Recall that all of the 256 evolution patterns given in
value functions are needed in this case, and Table 5 start from the same initial pattern, namely,
w2=4 2 3
6
w0=1 0 1
(a) w1=2
w4=16 4 w3=8 3
w6=64 6 7
w7=128
1
(b)
4 5
w5=32
Fig. 2. Subdivision of the Boolean cube into (a) a primary trihedron spanned by the four primary firing vertices
0,
1,
2
and 4 and (b) a secondary trihedron spanned by the four secondary firing vertices
3,
5,
6 and
7.
N = 0 ⇒ red and N = 0 ⇒ blue at t = 0. We will a three-pixel wide window, we will see that only
continue to assume this “single red center-pixel” ini- four firing patterns (out of the eight neighborhood
tial pattern throughout this paper. patterns shown on the bottom-left of Table 1) are
The output of each pixel Ci after each iteration possible, namely, P0 , P1 , P2 and P4 corresponding
depends only on the color pattern of three pixels; to the four vertices 0, 1,
2 and 4 . If any one
namely, Ci−1 , Ci and Ci+1 (see Fig. 1). If we scan of these four patterns appears at the above “scan-
this initial pattern using a black mask with only ning window”, and if the corresponding vertex of
the Boolean cube is painted in red, then the cell at distinct groups of Boolean cubes, henceforth called
the center of the window will be painted red in the CA gene families, and denoted by the correspond-
next generation. We will henceforth refer to P0 , P1 , ing symbols G0 , G1 , G2 , G3 , G4 , G5 , G6 , G7 , G16 , G17 ,
P2 and P4 as the primary firing patterns. Since the G18 , G19 , G20 , G21 , G22 and G23 . Note the subscript of
“single red center pixel” initial pattern cannot elicit each gene family is equal to its corresponding total
any response from the remaining four neighborhood vertex weight WP .
patterns P3 , P5 , P6 and P7 , we will henceforth refer Observe that there is an abrupt change (from
to them as secondary firing patterns. They are sec- 7 to 16) in the subscript code of the 2 consecutive
ondary because they can influence the outcome of gene families G7 and G16 even though their corre-
the evolution only after the first generation, whose sponding four-bit binary words are in consecutive
output pattern may contain one or more of these order (7 and 8). This comes from the discontinuity
secondary firing patterns. in the subscript of P4 and that of its neighbor P2 .
To derive an intuitive feeling on the evolution We will see shortly that this discontinuity induces a
of patterns from one generation to the next one, it red ↔ blue vertex transformation between each gene
is useful to partition the Boolean cube into the two family in Table 6 and a corresponding gene family
Trihedrons shown in Fig. 2. in Table 7.
The upper trihedron is called the primary tri- Since the secondary firing patterns do not elicit
hedron because it contains the four primary pattern a response from the “single red center-pixel” initial
firing vertices 0, 1, 2 and 4 at the intersection pattern, the outcomes after one iteration (first gen-
of its three faces. The lower trihedron is called the eration) of all local rules N belonging to a particular
secondary trihedron for corresponding reasons. gene family are identical regardless of the color of
From a group-theoretic perspective, the primary the vertices 3, 5, 6 and 7 , and are given in the
trihedron and the secondary trihedron exhibit an S2 rightmost column in Tables 6 and 7.
inversion symmetry in the sense that each pair of
the vertices
4.3. Each gene family has 16 gene
{
0,
7 } , {
1,
6 } , {
2,
5 } , {
4,
3}, siblings
lie on a straight line through the origin of the The four secondary firing patterns P3 , P5 , P6 and P7
Boolean cube. Observe that each red vertex within can evoke a response when the output pattern from
each pair maps onto a blue vertex of the same pair the first iteration, or subsequent iterations, contain
via a 180◦ -rotation about the vertical axis through these patterns, and if the corresponding vertices are
the origin (center of Boolean cube), and followed by painted in red. In such cases, each combination of
a reflection above the horizontal plane through the these secondary firing patterns will give rise to a dif-
origin. ferent evolved output pattern. The 16 distinct com-
binations of these patterns are shown in Tables 8–10
for the three gene families G2 , G6 and G22 , using
4.2. Partitioning 256 local rules
the same binary format as Table 7. The sum WS
into 16 gene families of the vertex weights wk of all “red” (coded by 1)
Since only four firing patterns can elicit a response secondary firing vertices is listed in the adjacent col-
from the single red center-pixel initial pattern, there umn. Adding the total secondary vertex weight WS
are a total of 16 possible combinations, as shown to the corresponding total firing vertex weight WP
in Tables 6 and 7. Each combination is coded by from Table 7 (which we reproduce in Tables 8–10
a four-bit binary number, where a bit is “1” if and for gene families G2 , G6 and G22 ) for each gene fam-
only if the corresponding vertex of the Boolean cube ily gives the number N of the unique Boolean cube
is painted red. Since each vertex k is associated whose vertices bear the eight binary bits (not in the
with a vertex weight wk = 2k , the sum WP of the same order as the eight-bit word in Table 1) listed
vertex weights wk of all “red” (coded by 1) primary in the corresponding row in Tables 8–10, for gene
firing vertices can be used to identify the combina- families G2 , G6 and G22 , and from the correspond-
tion of primary firing patterns characterizing each ing row in Table 7. Note that WS is invariant in
of the 256 Boolean cubes in Table 1. These 16 com- Tables 8–10. This is why the 16 local rules listed
bined vertex weights are equal to 0, 1, 2, 3, 4, 5, 6, in the rightmost column of Tables 8–10 are called
7, 16, 17, 18, 19, 20, 21, 22 and 23. They define 16 gene siblings. We pick only three gene families for
Table 6. Definition of CA Gene Family G0 , G1 , G2 , G3 , G4 , G5 , G6 and G7 . The symbol Pk denotes the firing pattern at red
k whose vertex weight is equal to wk = 2k and where WP = sum of wk of all firing patterns (coded by 1).
vertex
Total Primary Firing Pattern Initial Pattern:

CA
Primary 1 Red pixel at center
Gene P4 P2 P1 P0
Vertex
Family
Weight Evolved Pattern:
Code
WP w4 = 16 w2 = 4 w1 = 2 w0 = 1 1st Generation
G0 0 0 0 0 0
G1 w0
=1 0 0 0 1
G2 w1
=2 0 0 1 0
G3
w1+ w0
=3 0 0 1 1
G4 w2
=4 0 1 0 0
G5 w2+ w0
=5 0 1 0 1
G6
w2+ w1
=6 0 1 1 0
w2+ w1
G7 + w0 0 1 1 1
=7
Table 7. Definition of CA Gene Family G16 , G17 , G18 , G19 , G20 , G21 , G22 and G23 . The symbol Pk denotes the firing pattern
k whose vertex weight is equal to wk = 2k and where WP = sum of wk of all firing patterns (coded by 1).
at red vertex
Total Primary Firing Pattern Initial Pattern:

CA
Primary 1 Red pixel at center
Gene P4 P2 P1 P0
Vertex
Family
Weight Evolved Pattern:
Code
WP w4 = 16 w2 = 4 w1 = 2 w0 = 1 1st Generation
G16 w4
= 16 1 0 0 0
G17 w 4+ w 0
= 17 1 0 0 1
G18 w 4+ w 1
= 18 1 0 1 0
w 4+ w 1
G19 + w0 1 0 1 1
= 19
G20 w 4+ w 2
= 20 1 1 0 0
w 4+ w 2
G21 + w0 1 1 0 1
= 21
w 4+ w 2
G22 + w1 1 1 1 0
= 22
w 4+ w 2
G 23 + w1 + w0 1 1 1 1
= 23
Table 8. CA Gene Family G2 and its siblings.
Secondary Firing Pattern Gene Family G2

Total Total
P7 P6 P5 P3 Local
Secondary Primary
Rule
Vertex Vertex
Number
Weight Weight
N=WP+WS
w7 = 128 w6 = 64 w5 = 32 w 3= 8 WS WP
0 0 0 0 0 2 2
w3
0 0 0 1 2 10
=8
w5
0 0 1 0 2 34
= 32
w5+ w3
0 0 1 1 2 42
= 40
w6
0 1 0 0 2 66
= 64
w6+ w3
0 1 0 1 2 74
= 72
w6+ w5
0 1 1 0 2 98
= 96
w6+ w5 + w3
0 1 1 1 2 106
= 104
W7
1 0 0 0 2 130
= 128
W7+w3
1 0 0 1 2 138
= 136
W7+ w5
1 0 1 0 2 162
= 160
W7+ w5+ w3
1 0 1 1 2 170
= 168
W7+ w6
1 1 0 0 2 194
= 192
W7+ w6+ w3
1 1 0 1 2 202
= 200
W7+ w6+ w5
1 1 1 0 2 226
= 224
W7+ w6+ w5 + w3
1 1 1 1 2 234
= 232

Total Total
P7 P6 P5 P3 Local
Secondary Primary
Rule
Vertex Vertex
Number
Weight Weight
N=WP+WS
w7 = 128 w6 = 64 w5 = 32 w3= 8 WS WP
0 0 0 0 0 6 6
w3
0 0 0 1 6 14
=8
w5
0 0 1 0 6 38
= 32
w5+ w3
0 0 1 1 6 46
= 40
w6
0 1 0 0 6 70
= 64
w6+ w3
0 1 0 1 6 78
= 72
w6+ w5
0 1 1 0 6 102
= 96
w6+ w5 + w3
0 1 1 1 6 110
= 104
W7
1 0 0 0 6 134
= 128
W7+w3
1 0 0 1 6 142
= 136
W7+ w5
1 0 1 0 6 166
= 160
W7+ w5+ w3
1 0 1 1 6 174
= 168
W7+ w6
1 1 0 0 6 198
= 192
W7+ w6+ w3
1 1 0 1 6 206
= 200
W7+ w6+ w5
1 1 1 0 6 230
= 224
W7+ w6+ w5 + w3
1 1 1 1 6 238
= 232

Total Total
P7 P6 P5 P3 Local
Secondary Primary
Rule
Vertex Vertex
Number
Weight Weight
N=WP+WS
w7 = 128 w6 = 64 w5 = 32 w 3= 8 WS WP
0 0 0 0 0 22 22
w3
0 0 0 1 22 30
=8
w5
0 0 1 0 22 54
= 32
w5+ w3
0 0 1 1 22 62
= 40
w6
0 1 0 0 22 86
= 64
w6+ w3
0 1 0 1 22 94
= 72
w6+ w5
0 1 1 0 22 118
= 96
w6+ w5 + w3
0 1 1 1 22 126
= 104
W7
1 0 0 0 22 150
= 128
W7+w3
1 0 0 1 22 158
= 136
W7+ w5
1 0 1 0 22 182
= 160
W7+ w5+ w3
1 0 1 1 22 190
= 168
W7+ w6
1 1 0 0 22 214
= 192
W7+ w6+ w3
1 1 0 1 22 222
= 200
W7+ w6+ w5
1 1 1 0 22 246
= 224
W7+ w6+ w5 + w3
1 1 1 1 22 254
= 232
illustrative purposes. Needless to say, each of the 13 members 74, 98, 106, 130, 138, 162, 170, 194, 202,
remaining gene families will generate a different set 226 and 234. The readers should verify that these
of 16 siblings. 16 numbers are identical to those listed under G2
The 16 gene siblings associated with each of the (column 3) in Table 11.
eight gene families G0 , G1 , G2 , G3 , G4 , G5 , G6 and G7 To verify that the above algorithm can be used
(from Table 6) are listed in Table 11. Altogether, to generate all of the 16 local rules listed under each
Table 11 contains 128 of the 256 Boolean cubes listed gene family (i.e. column) in Tables 11 and 12, ob-
in Table 1. For reasons that will be obvious in the serve that if we add the number “8” to all numbers
following section, we will henceforth refer to this in any odd-numbered row, we would obtain the cor-
collection as the blue gene family group B. responding number listed in the next row (which is
The 16 gene siblings associated with each of now an even-numbered row) of Tables 11 and 12.
the remaining eight gene families G16 , G17 , G18 , G19 , Similarly, if we add the number “24” to all num-
G20 , G21 , G22 and G23 (from Table 7) are listed in Ta- bers in any even-numbered row, we would obtain
ble 12. Altogether, Table 11 contains the remaining the number listed in the next row (which reverts to
128 of the 256 Boolean cubes listed in Table 1. For an odd-numbered row) of Tables 11 and 12.
reasons that will be obvious in the following section, To understand why this simple algorithm works
we will henceforth refer to this collection as the red for all gene families, let us examine the first four
gene family group R. columns in Table 8. Note that the bit “1” appears
in the column under the secondary firing pattern
P3 of every even-numbered row, thereby contribut-
5. The Double-Helix Torus
ing its associated vertex weight number w3 = 23 = 8
Our objective in this section is to introduce a to the total secondary vertex weight WS .
very compact and enlightening representation of the Moreover, observe that whenever the bit “1”
256 local rules from Table 1, henceforth called the appears (at even-numbered rows) under the right-
double-helix torus, which can be used to encode all most column P3 , its three associated binary bits on
of the data from Tables 6 and 7, as well as other its left (at the same row) are identical to the corre-
relevant new information and relationships to be sponding bits in the preceding row. Consequently,
introduced below. only the number “8” needs to be added to WP to
obtain the local rule number N in the last column.
5.1. Algorithm for generating all 16 Now examine the odd-numbered rows in Table 8
and note that if we add all of the vertex weights
local rules belonging to each
algebraically (adding if it flips from 0 to 1, and sub-
gene family
tracting if it flips from 1 to 0) where a bit had
The 16 local rules belonging to each gene family flipped from the preceding row, we would always
Gm ∈ {G0 , G1 , G2 , G3 , G4 , G5 , G6 , G7 , G16 , G17 , G18 , obtain a net contribution equal to 24. This prop-
G19 , G20 , G21 , G22 , G23 } can be generated by adding, erty holds also for the gene family G6 in Table 9,
alternatingly, the number “8” and “24” to the ger- and G22 in Table 10, and in fact for all gene fami-
minating local rule number “m”, where m is the lies because the first four columns used in the above
subscript associated with the first member of the analysis are identical in all cases.
gene families listed in Tables 11 and 12.
Example. Generate all members of G2 .

5.2. “8/24” Distribution pattern in
gene siblings
Here, m = 2, and the germinating local rule is there- In order to visualize the distribution of gene siblings
fore identified by the number N = 2, which is the in each gene family listed in Tables 11 and 12, let
first member of G2 . Adding “8” to N = 2 gives the us print the entire list of 256 Boolean cubes (local
second member N = 2 + 8 = 10. Adding “24” to rules) from Table 1 on a uniformly labeled loop as
N = 10 gives the third member N = 10 + 24 = 34. shown in Fig. 3. The two colors here have no sig-
Adding “8” to N = 34 gives the fourth member nificance other than to help visualization. A closed
N = 34 + 8 = 42. Adding “24” to 42 gives the fifth loop instead of an open-ended string is chosen here
member N = 42 + 24 = 66. Continuing this “8/24” in view of the “periodicity” property of the gene
“alternating” algorithm, we generate the remaining families to be discussed next.
Table 11. Members of the blue gene family group B.
Gene Family
G0 G1 G2 G3 G4 G5 G6 G7
1 0 1 2 3 4 5 6 7
2 8 9 10 11 12 13 14 15
3 32 33 34 35 36 37 38 39
4 40 41 42 43 44 45 46 47
5 64 65 66 67 68 69 70 71
Gene Siblings
6 72 73 74 75 76 77 78 79
7 96 97 98 99 100 101 102 103
8 104 105 106 107 108 109 110 111
9 128 129 130 131 132 133 134 135
10 136 137 138 139 140 141 142 143
11 160 161 162 163 164 165 166 167
12 168 169 170 171 172 173 174 175
13 192 193 194 195 196 197 198 199
14 200 201 202 203 204 205 206 207
15 224 225 226 227 228 229 230 231
16 232 233 234 235 236 237 238 239

Table 12. Members of the red gene family group R.
Gene Family
G16 G17 G18 G19 G20 G21 G22 G23
1 16 17 18 19 20 21 22 23
2 24 25 26 27 28 29 30 31
3 48 49 50 51 52 53 54 55
4 56 57 58 59 60 61 62 63
5 80 81 82 83 84 85 86 87
Gene Siblings
6 88 89 90 91 92 93 94 95
7 112 113 114 115 116 117 118 119
8 120 121 122 123 124 125 126 127
9 144 145 146 147 148 149 150 151
10 152 153 154 155 156 157 158 159
11 176 177 178 179 180 181 182 183
12 184 185 186 187 188 189 190 191
13 208 209 210 211 212 213 214 215
14 216 217 218 219 220 221 222 223
15 240 241 242 243 244 245 246 247
16 248 249 250 251 252 253 254 255

246 248 250 252 254 N=0 2 4 6 8 10 12
247 249 251 253 255 1 3 5 7 9 11 13 14

244 245
15
243 16
242
17
241
39 37 35 33 31 29 25 23 21 19 18
240 41 27
43
42 40 38 36 34 32 30 28 26 24 22 20
239 44
238
45
237 46
236
48 50 52 54 56 58 60 62 64 66 68 70
235 47
49 51 53 55 57 59 61 63 65 67 69
234 71
72
233
73
232
231 97 95 93 91 89 87 85 83 81 79 77 75 74
230 99 96 94 92 90 88 86 84 82 80 78 76
98
229 100
228 101
102
227
104 106 108 110 112 114 116 118 120 122 124 126
226
103 105 107 109 111 113 115 117 119 121 123 125
225 127 128
224
129
223
153 151 149 147 145 143 141 139 137 135 133 131 130
222
155
221 154 152 150 148 146 144 142 140 138 136 134 132
156
220
157
219
158
218 164 166
217 160 162 168 170 172 174 176 178 180 182
159 184
161 163 165 167 169 171 173 175 177 179 181
183
216
215 185
214 213 187 186
211 209 207 205 203 201 199 197 195 193 191 189
212 188
210 208 206 204 202 200 198 196 194 192 190
Fig. 3. A loop partitioned into 256 equal units, labeled consecutively from N = 0 to N = 255. Each number corresponds to
a local rule.
16
0 2 22 18
4
6 20
Fig. 4. Partitioning of all even gene families G0 , G2 , G4 , G6 , G16 , G18 , G20 and G22 into 16 gene siblings for each family.
17
1 3 23 19
5 21
7
Fig. 5. Partitioning of all odd gene families G1 , G3 , G5 , G7 , G17 , G19 , G21 and G23 into 16 gene siblings for each family.
Recall from the “local rule generation algo- an even-numbered row, we would exceed the maxi-
rithm” from Sec. 5.1 that if we add the number “24” mum number 256 in Fig. 3. However, if we perform
to any even-numbered rule of any gene family Gm , the addition in modulo 256 arithmetic, we would ob-
we would obtain the next local rule number (which tain the numbers listed in row 1 of Gm . Hence, each
is necessarily an odd-numbered row by construction) gene family is periodic modulo 256. This means that
listed in Gm . If we apply this algorithm to each fam- if we track the sequence of 16 local rule numbers in
ily in the last tow (16) in Tables 11 and 12, which is each gene family Gm in Fig. 3, we would eventually
0
23 2 8
7
4 6 32
22 5
4
3
200
40
2
1
0
192
64
168
72
0
16
96
104
136
128
Fig. 6. Concentric circular representation of the blue gene family group B. Every local rule number in Table 11 is mapped in
a one-to-one manner to an intersection between a circle and a half line.
0
23 2 8
23
22
4 32
22 21
20
19
200
40
18
17
16
192
64
168
72
0
16
96
104
136
128
Fig. 7. Concentric circular representation of the red gene family group R. Every local rule number in Table 11 is mapped in
a one-to-one manner to an intersection between a circle and a half line.
return to the starting point. We have plotted this are identical for all 16 gene families, namely, succes-
sequence of points for each gene family on the same sive points are separated alternatingly by a distance
loop in Fig. 3, but subdivided them into 16 different of “8” and “24” units, respectively.
adjacent tracks to avoid clutter. They are shown in In view of this 8/24 alternating periodicity
Fig. 4 for the even-numbered families, and in Fig. 5 property, we can represent the eight gene families
for the odd-numbered families. Observe that except from Tables 11 and 12 by eight concentric circles,
for a translation in space, the distribution patterns as shown in Figs. 6 and 7, respectively. Each set
of concentric circles is superimposed on top of 16 the first seven local rules (0, 8, 32, 40, 64, 72, 96) and
uniformly-spaced radial half lines, labeled by weight the last local rule (232) using an expanded scale for
factors which increases from 0 via the alternating clarity. The corresponding “complementary” rules
increments of 8 and 24, respectively. Although not (255, 247, 223, 215, 191, 183, 159) from the last
shown in Figs. 6 and 7 to avoid clutter, each cir- seven entries in G23 in Table 12, and the comple-
cle has 16 intersections with each radial line. Each mentary local rule (23) from the first entry in G23
intersection defines the gene sibling number ob- in Table 12 are also shown in this figure. If we sim-
tained by adding the “circle number” to the “weight ply join the ends of these two ribbons together, we
factor” of the corresponding radial line. For exam- would obtain the 16 local rules represented by the
ple, the intersection between the “orange” circle innermost circle 0 in Fig. 6, and the 16 “comple-
no. 4 with the third radial line (with weight factor mentary” rules represented by the outermost circle
32) gives the rule no. 4 + 32 = 36, which is the third 23 in Fig. 7. We can repeat this construction pro-
gene sibling belonging to gene family G4 . Every rule cess and obtain eight disconnected double-stranded
listed in Tables 11 and 12 is mapped in a one-to-one rings, which together would account for all 256 local
manner onto one of these intersections. rules.
However, since each gene family is a subset of
5.3. Coding local rules on a double the single 256-unit loop presented earlier in Fig. 3, it
helix is more enlightening to join all of these eight disjoint
double-stranded rings together (in the same order
Each of the two gene family groups B and R listed
as Table 12) into a single loop, which would occupy
in Tables 11 and 12 contains 128 distinct Boolean
half as many locations as in the 256-unit loop in
cubes extracted from Table 1, and arranged in a
Fig. 3, but still contains all 256 local rules since two
different order. If we take their complements by
complementary rules are encoded at each location.
changing the color of the vertices of each Boolean
The resulting structure, shown only for the three
cube from blue to red, or red to blue, respectively,
gene families G7 , G0 , G1 in Fig. 8(a), is reminiscent
we would generate the remaining 128 Boolean cubes
of the classic double helix for encoding the DNA
from Table 1, again arranged in a different order. It
[Watson, 2003], which also contains 2 oppositely-
follows that for each local rule N1 belonging to B,
there is a “complementary” rule N2 belonging to directed complementary strands. The main differ-
R. Their ID numbers are related by the “Red–Blue ence is that unlike a DNA, which can be of any
complementary transformation” defined in [Chua length and is therefore wound on a cylinder, our
et al., 2002], namely, N1 + N2 = 255. double-strand is a loop containing exactly 128 local
A careful examination of the entries in Ta- rules on each strand, and hence should be wound on
bles 11 and 12 shows that if we rotate Table 12 by a torus, as depicted in Fig. 8(b), henceforth called
180◦ , then each Boolean cube in B and its comple- the double-helix torus.
ment in R would occupy the same position. For fu- The double-helix torus gives a compact and
ture reference, each local rule belonging to the blue complete representation of all 256 local rules from
gene family B is shown in Table 13 along with its Table 1. However, instead of the ordering scheme
associated Boolean cube. The complementary local used in Table 1 which did not exploit the primary
rule and Boolean cube are redrawn from Table 12 “firing patterns” of local rules, the Boolean cubes
(following a 180◦ rotation) and shown in Table 14. encoded into the double-helix torus in Fig. 8(b) are
They are the members from the red gene family in one-to-one correspondence with those belonging
group R. to the 16 gene families listed in Tables 11 and 12,
Each gene family Gm listed in Table 13 and where each family is characterized by a primary fir-
its complement in Table 14 can be encoded on two ing pattern. The compactness in this representation
oppositely-directed ribbons, each containing 16 en- arises from using the blue strand to encode all local
tries, where each pair of complementary rules are rules from the blue gene family B, and to use the
coupled together in a “key-and-lock” fit, and de- red strand to encode all local rules from the red gene
picted by a pointed stick (attached to a thin blue family R, thereby doubling the bit density.
ribbon), mated to a dented stick (attached to a red Let us imagine that the 16 “local rule” ID num-
ribbon), as shown in the center of Fig. 8(a) for the bers in each column of Table 11 are printed on a thin
gene family G0 . To avoid clutter, we have shown only blue ribbon 16 units longs. Similarly, print the eight
Table 13. Members of the blue gene family group B and their Boolean cubes.
Gene Family
G0 G1 G2 G3 G4 G5 G6 G7
1 0 1 2 3 4 5 6 7
2 8 9 10 11 12 13 14 15
3 32 33 34 35 36 37 38 39
4 40 41 42 43 44 45 46 47
5 64 65 66 67 68 69 70 71
6 72 73 74 75 76 77 78 79
Gene Siblings
7 96 97 98 99 100 101 102 103
8 104 105 106 107 108 109 110 111
9 128 129 130 131 132 133 134 135
10 136 137 138 139 140 141 142 143
11 160 161 162 163 164 165 166 167
12 168 169 170 171 172 173 174 175
13 192 193 194 195 196 197 198 199
14 200 201 202 203 204 205 206 207
15 224 225 226 227 228 229 230 231
16 232 233 234 235 236 237 238 239

Table 14. Members of the red gene family group R and their Boolean cubes, redrawn after rotating Table 12 by 180◦ .
Gene Family
G23 G22 G21 G20 G19 G18 G17 G16
16 255 254 253 252 251 250 249 248
15 247 246 245 244 243 242 241 240
14 223 222 221 220 219 218 217 216
13 215 214 213 212 211 210 209 208
12 191 190 189 188 187 186 185 184
11 183 182 181 180 179 178 177 176

Gene Siblings
10 159 158 157 156 155 154 153 152
9 151 150 149 148 147 146 145 144
8 127 126 125 124 123 122 121 120
7 119 118 117 116 115 114 113 112
6 95 94 93 92 91 90 89 88
5 87 86 85 84 83 82 81 80
4 63 62 61 60 59 58 57 56
3 55 54 53 52 51 50 49 48
2 31 30 29 28 27 26 25 24
1 23 22 21 20 19 18 17 16
2473
(a)
(b)
70 185
78 177
102 153
G16
238
248 7
G7
240 15
216
47
71 184
79 176
Fig. 8.
103 152
239
G23
G0
255 0
247 8
223 32
The double-helix torus.

40
64 191
72 183
96 159
232
G22
G1
254 1
246 9
222
41
65 190
columns of Table 12 onto eight thin red ribbons. and “firing ” patterns. The outcomes after the first
If we join the bottom edge of each blue ribbon to iterations, however will in general differ because
the top edge of its right adjacent ribbon (i.e. con- one or more secondary firing patterns may “kick
nect the pairs (232, 1), (233, 2), (234, 3), (235, 4), in”. To uncover the characteristic features of each
(236, 5), (237, 6), (238, 7) together), we would ob- gene family, the entries in Table 5 were reorganized
tain a 128-unit long blue ribbon with all 128 local according to the gene family they belong, and pre-
rule numbers from the gene family B (Table 11) sented in Tables 15.1–15.16, along with their as-
printed on it. The blue ribbon shown in Fig. 8(a) sociated Boolean cubes, complexity index, and the
shows only three sections of this strand. If we now primary (left side) and secondary (right side) firing
join the top edge of the blue ribbon (rule 0 of G0 ) to patterns. All red vertices belonging to the primary
its bottom edge (rule 239 of G7 ), we would obtain trihedron are painted with a light-red interior to
the blue ribbon loop shown encircling the torus in highlight the primary firing vertices.
Fig. 8(b). Applying exactly the same procedure to A cursory examination of Table 15 shows that
the red gene family R in Table 12, we obtain the all 16 siblings from each of four gene families G0 ,
complementary red ribbon loop in Fig. 8(b). G2 , G4 and G16 display identical output patterns.
We will discover in the next section how the To explain why the 16 patterns within each fam-
double-helix torus organizes the dynamic (evolu- ily are identical, observe that each family has only
tion) patterns in Table 5 in a unified manner, one primary firing pattern. This implies that one,
thereby allowing us to explain if not predict the and only one, pixel in generation 1 will be painted
characteristic features of the patterns in Table 5 in red, at the center location for family G0 and
without carrying out any brute force computer G4 , since the primary pattern is symmetric, or at
simulations. the first left (resp. first right)-of-center location for
family G2 (resp., G16 ), since the primary firing pat-
tern is asymmetrical and “fires” if, and only if, the
6. Explaining and Predicting center of the window neighborhood pattern is an-
Pattern Features chored at the first left (resp., first right)-of-center
Our goal in this final section is to identify some uni- position.
fying principles which will allow us to either predict Since the remaining 12 gene families have at
or explain the garden variety of patterns presented least two primary firing patterns, we can expect
in Table 5. All of the 30 × 61 patterns in this table different siblings will in general evolve different
were generated from the same “single red center- patterns, even though they belong to the same gene
pixel” initial pattern, and are identical to those pre- family. In order to explain the genesis of these pat-
sented in [Wolfram 2002] and [Chua et al., 2002]. tern variations, let us turn to the next subsection
where more subtle organizational principles will be
uncovered.
6.1. Gallery of gene family patterns
The 256 patterns scattered throughout Table 5 do 6.2. Predicting the background
not display any logical relationships because the
Observe that in all of the patterns exhibited in
ordering scheme, though quite elegant, did not make
Table 15 there are vast subregions characterized by
use of any unifying dynamic organization principles.
either homogeneous or regularly repeating patterns
We will now show that the primary firing patterns
which convey no new information as the iteration
which we used in Sec. 4.2 to derive the 16 gene
continues. We will henceforth refer to such subre-
families provide us with one such unifying princi-
gions as the background. Assuming that there is no
ple. In particular, since each of the 16 gene siblings
noise in our iterations,4 the following typical pat-
belonging to a gene family has the same primary
terns will emerge from a “single red center-pixel”
firing patterns, we can expect certain common fea-
initial pattern under the following conditions:
tures. For example, the evolved patterns at the first
generation (i.e. after one iteration) are identical for (a) Blue background. This case will emerge when-
all siblings since they all have the same “initial ” ever the vertex
0 is painted in blue. It includes
4
A randomly-generated pixel noise can, in certain cases, give rise to uncontrolled dynamics which may eventually obliterate
the previous background.
Table 15.1. Boolean Cube Family G0 germinated from Rule 0 via a single red center-pixel (. . . 0, 0, 1, 0, 0, . . .) initial condition.
Rule 0 ț =1 Rule 8 ț =1 Rule 32 ț =1 Rule 40 ț=2

Firing Patterns Firing Patterns Firing Patterns Firing Patterns
0 red pixel 2 red pixels 0 red pixel 2 red pixels 0 red pixel 2 red pixels 0 red pixel 2 red pixels
3 5 3 5
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 64 ț =1 Rule 72 ț=2 Rule 96 ț=2 Rule 104 ț=2

6 3 6 5 6 3 5 6
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2475
Rule 128 ț =1 Rule 136 ț =1 Rule 160 ț =1 Rule 168 ț =1
3 5 3 5
7 7 7 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
7 7 7 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 65 ț=2 Rule 73 ț=2 Rule 97 ț=2 Rule 105 ț =3

0 6 0 3 6 0 5 6 0 3 5 6
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2476
Rule 129 ț=2 Rule 137 ț=2 Rule 161 ț=2 Rule 169 ț=2
0 0 3 0 5 0 3 5
7 7 7 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
7 7 7 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

3 5 3 5
1 1 1 1
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
1 1 1 1
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2477
Rule 130 ț=2 Rule 138 ț =1 Rule 162 ț =1 Rule 170 ț =1
3 5 3 5
1 7 1 7 1 7 1 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 194 ț=2 Rule 202 ț = 3 Rule 226 ț = 3 Rule 234 ț =1

6 3 6 5 6 3 5 6
1 7 1 7 1 7 1 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
1 1 1 1
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
1 1 1 1
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2478
0 0 3 0 5 0 3 5
1 7 1 7 1 7 1 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
1 7 1 7 1 7 1 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 4 ț =1 Rule 12 ț =1 Rule 36 ț=2 Rule 44 ț=2

3 5 3 5
2 2 2 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 0 3 6 5 6 3 5 6
2 1 2 4 2 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2479
Rule 132 ț=2 Rule 140 ț =1 Rule 164 ț=2 Rule 172 ț =3
3 5 3 5
2 7 2 7 2 7 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
2 7 2 7 2 7 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
2 2 2 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
2 2 2 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2480
Rule 133 ț=2 Rule 141 ț =3 Rule 165 ț=2 Rule 173 ț=2
0 0 3 0 5 0 3 5
2 7 2 7 2 7 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
2 7 2 7 2 7 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

3 5 3 5
1 2 1 2 1 2 1 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 70 ț=2 Rule 78 ț =3 Rule 102 ț=2 Rule 110 ț=2

6 3 6 5 6 3 5 6
1 2 1 2 1 2 1 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2481
3 5 3 5
1 2 7 1 2 7 1 2 7 1 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
6 3 6 5 6 3 5 6
1 2 7 1 2 7 1 2 7 1 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
1 2 1 2 1 2 1 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
1 2 1 2 1 2 1 2
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2482
0 0 3 0 5 0 3 5
1 2 7 1 2 7 1 2 7 1 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
1 2 7 1 2 7 1 2 7 1 2 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 16 ț =1 Rule 24 ț=2 Rule 48 ț =1 Rule 56 ț=2

3 5 3 5
4 4 4 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
4 4 4 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2483
Rule 144 ț=2 Rule 152 ț=2 Rule 176 ț =1 Rule 184 ț =3
3 5 3 5
4 7 4 7 4 7 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
4 7 4 7 4 7 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
4 4 4 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
4 4 4 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2484
Rule 145 ț=2 Rule 153 ț=2 Rule 177 ț =3 Rule 185 ț=2
0 0 3 0 5 0 3 5
4 7 4 7 4 7 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
4 7 4 7 4 7 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 18 ț=2 Rule 26 ț=2 Rule 50 ț =1 Rule 58 ț = 3

3 5 3 5
1 4 1 4 1 4 1 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
Rule 82 ț=2 Rule 90 ț=2 Rule 114 ț = 3 Rule 122 ț=2

6 3 6 5 6 3 5 6
1 4 1 4 1 4 1 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2485
3 5 3 5
1 4 7 1 4 7 1 4 7 1 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
6 3 6 5 6 3 5 6
1 4 7 1 4 7 1 4 7 1 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
1 4 1 4 1 4 1 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
1 4 1 4 1 4 1 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2486
0 0 3 0 5 0 3 5
1 4 7 1 4 7 1 4 7 1 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
0 6 0 3 6 0 5 6 0 3 5 6
1 4 7 1 4 7 1 4 7 1 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

3 5 3 5
2 4 2 4 2 4 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 0 3 6 5 6 3 5 6
2 4 2 4 2 4 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2487
3 5 3 5
2 4 7 2 4 7 2 4 7 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

6 3 6 5 6 3 5 6
2 4 7 2 4 7 2 4 7 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
2 4 2 4 2 4 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
2 4 2 4 2 4 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2488
0 0 3 0 5 0 3 5
2 4 7 2 4 7 2 4 7 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
2 4 7 2 4 7 2 4 7 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

3 5 3 5
1 2 4 1 2 4 1 2 4 1 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
6 3 6 5 6 3 5 6
1 2 4 1 2 4 1 2 4 1 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2489
3 5 3 5
1 2 4 7 1 2 4 7 1 2 4 7 1 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
6 3 6 5 6 3 5 6
1 2 4 7 1 2 4 7 1 2 4 7 1 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 0 3 0 5 0 3 5
1 2 4 1 2 4 1 2 4 1 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
1 2 4 1 2 4 1 2 4 1 2 4
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
2490
0 0 3 0 5 0 3 5
1 2 4 7 1 2 4 7 1 2 4 7 1 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5

0 6 0 3 6 0 5 6 0 3 5 6
1 2 4 7 1 2 4 7 1 2 4 7 1 2 4 7
2 3 2 3 2 3 2 3
6 7 6 7 6 7 6 7
0 1 0 1 0 1 0 1
4 5 4 5 4 5 4 5
all even-numbered gene families; namely, G0 , G2 , painted red in the first generation. But since
G4 , G6 , G16 , G18 , G20 and G22 . the primary firing pattern P0 at vertex 0 con-
To prove the above assertion, observe that sists of only blue pixels, and since vertex 7 is
since the neighborhood pattern P0 associated painted in blue all of these red pixels will revert
with vertex 0 consists of three consecutive blue to blue in the second generation, except possi-
pixels, it would coincide with all of the blue bly for some pixels near the center location. The
pixels in the initial pattern, except possibly for above scenario will simply repeat itself in all fu-
the two pixels on either side of the center lo- ture iterations. Hence, the background will be
cation. Since vertex 0 is painted in blue, these made up of alternating red and blue horizontal
coincident blue pixels must maintain their blue stripes.
status. Hence, except possibly for some region
on either side of the center location, the back-
ground will appear in blue. Acknowledgments
(b) Red background. This case will emerge when- This work is supported in part by the DURINT
ever both vertices 0 and 7 are painted in red. contract no. N00014-01-1-0741, the ONR con-
It includes the lower-half portion of all odd- tract N000-14-03-1-0698, and the NSF grant
numbered gene families; namely, G1 , G3 , G5 , G7 , CHE-0103447.
G17 , G19 , G21 and G23 .
To prove the above assertion, observe that
except for the two pixels on either side of the References
center location, all blue pixels in the initial pat- Chua, L. O. [1998] CNN: A Paradigm for Complexity
tern will switch from blue to red in the first (World Scientific, Singapore).
generation. All of these newly converted red Chua, L. O. Yoon, S. & Dogaru, R. [2002] “A non-
pixels, except possibly for some near the cen- linear dynamics perspective of Wolfram’s new kind
ter location, must maintain their red status in of science. Part I: Threshold of complexity,” Int. J.
all subsequent iterations because the neighbor- Bifurcation and Chaos 12, 2655–2766.
hood pattern P7 at vertex 7 consists of three Dogaru, R., Chitu, C. & Glesner, M. [2003] “A uni-
consecutive red pixels. Hence, except for some versal CNN neuron for CMOS technology: Model
region on either side of the center location, the and functional capabilities,” Proc. SCS 2003, Int.
background will appear in red. Symp. Circuits and Systems, Iasi, Romania, July
2003, pp. 181–184
(c) Striped (alternating red-blue) background. This
Sbitnev, V. I., Yang, T. & Chua, L. O. [2001] “The local
case will emerge whenever vertex 0 is painted activity criteria for difference-equation CNN,” Int. J.
in red but vertex 7 is painted in blue. It Bifurcation and Chaos 11, 311–419.
includes the upper-half portion of all odd Sbitnev, V. I. & Chua, L. O. [2002] “Local activity
numbered gene families; namely, G1 , G3 , G5 , G7 , criteria for discrete map CNN,” Int. J. Bifurcation
G17 , G19 , G21 and G23 . and Chaos 12, 1227–1272.
To prove this assertion, observe the out- Watson, J. [2003] DNA: The Secret of Life (Alfred A.
come of the first iteration will be identical Knopf, NY).
to case (b), i.e. except possibly for some pix- Wolfram, S. [2002] A New Kind of Sciences (Wolfram
els near the center location, all pixels will be Media, Inc., Champaign Illinois, USA).

Part II

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Part II

Uploaded by

Copyright:

Available Formats

Tutorials and Reviews

A NONLINEAR DYNAMICS PERSPECTIVE OF

LEON O. CHUA, VALERY I. SBITNEV and SOOK YOON

Received March 1, 2003; Revised May 15, 2003

1. Firing and Quenching Patterns It is important to remember that, for rea-

96 97 98 99 100 101 102 103

104 105 106 107 108 109 110 111

112 113 114 115 116 117 118 119

120 121 122 123 124 125 126 127

128 129 130 131 132 133 134 135

136 137 138 139 140 141 142 143

144 145 146 147 148 149 150 151

152 153 154 155 156 157 158 159

160 161 162 163 164 165 166 167

168 169 170 171 172 173 174 175

176 177 178 179 180 181 182 183

184 185 186 187 188 189 190 191

192 193 194 195 196 197 198 199

200 201 202 203 204 205 206 207

208 209 210 211 212 213 214 215

216 217 218 219 220 221 222 223

224 225 226 227 228 229 230 231

232 233 234 235 236 237 238 239

240 241 242 243 244 245 246 247

248 249 250 251 252 253 254 255

Table 2. Firing Patterns for local rule 110.

Vertex Decimal Equivalent

2 (-1, 1,-1) (0,1,0) P2

Table 3. Quenching Patterns for local rule 110.

Vertex Decimal Equivalent

Table 4. Parameters for the universal CA map.

Local Synaptic weights Local Synaptic weights

Local Synaptic weights Local Synaptic weights

Local Synaptic weights Local Synaptic weights

Local Synaptic weights Local Synaptic weights

Rule 8 : ț=2 Rule 9 : ț =1

Rule 20 : ț=2 Rule 2 : ț =1

Rule 22 : ț=2 Rule 23 : ț =1

Rule 24 : ț=2 Rule 25 : ț=2

Rule 26 : ț=2 Rule 27 : ț =3

Rule 28 : ț=2 Rule 29 : ț =3

Rule 30 : ț=2 Rule 3 : ț =1

Rule 36 : ț=2 Rule 37 : ț=2

Rule 40 : ț=2 Rule 4 : ț=2

Rule 44 : ț=2 Rule 45 : ț=2

Rule 56 : ț=2 Rule 57 : ț=2

Rule 60 : ț=2 Rule 6 : ț=2

Rule 64 : ț =1 Rule 65 : ț=2

Rule 70 : ț=2 Rule 7 : ț =3

Rule 72 : ț=2 Rule 73 : ț=2

Rule 74 : ț=2 Rule 75 : ț=2

uit +1 = sgn 2− [ | (−3+ | 3u t

Rule 82 : ț=2 Rule 83 : ț =3

Rule 86 : ț=2 Rule 87 : ț =1

Rule 88 : ț=2 Rule 89 : ț=2

Rule 90 : ț=2 Rule 9 : ț=2

uit +1 = sgn 2− [ | (3− | u t

Rule 94 : ț=2 Rule 95 : ț =1

Rule 96 : ț=2 Rule 97 : ț=2

Rule 00 : ț=2 Rule 0 : ț=2

Rule 04 : ț=2 Rule 05 : ț =3

Rule 06 : ț=2 Rule 07 : ț=2

Rule 8 : ț=2 Rule 9 : ț =1

Rule 20 : ț=2 Rule 2 : ț =1

Rule 30 : ț=2 Rule 3 : ț =1

Rule 40 : ț=2 Rule 4 : ț=2

Rule 60 : ț=2 Rule 6 : ț=2

Rule 70 : ț=2 Rule 7 : ț =3

Rule 90 : ț=2 Rule 9 : ț=2

Rule 00 : ț=2 Rule 0 : ț=2

Rule 04 : ț=2 Rule 05 : ț =3

Rule 06 : ț=2 Rule 07 : ț=2

Rule 08 : ț=2 Rule 09 : ț=2

Rule 0 : ț=2 Rule : ț=2

Rule 2 : ț =1 Rule 3 : ț =1

Rule 6 : ț =3 Rule 7 : ț =3

Rule 8 : ț=2 Rule 9 : ț =1

Rule 20 : ț=2 Rule 2 : ț=2

Rule 22 : ț=2 Rule 23 : ț=2

Rule 24 : ț=2 Rule 25 : ț=2

Rule 28 : ț =1 Rule 29 : ț=2

Rule 32 : ț=2 Rule 33 : ț=2

Rule 36 : ț =1 Rule 37 : ț=2

Rule 38 : ț =1 Rule39 : ț =3

Rule 40 : ț =1 Rule 4 : ț =3

Rule42 : ț =1 Rule 43 : ț =1

Rule 44 : ț=2 Rule 45 : ț=2

Rule 48 : ț=2 Rule 49 : ț=2

Rule 52 : ț=2 Rule 53 : ț=2

Rule 56 : ț=2 Rule 57 : ț=2

Rule 60 : ț =1 Rule 6 : ț=2

Rule 62 : ț =1 Rule 63 : ț =3

Rule 64 : ț=2 Rule 65 : ț=2

Rule 68 : ț =1 Rule 69 : ț=2

Rule 70 : ț =1 Rule 7 : ț =1

Rule 72 : ț =3 Rule 73 : ț=2

Rule 74 : ț =1 Rule 75 : ț =1

Rule 76 : ț =1 Rule 77 : ț =3

Rule 78 : ț =1 Rule 79 : ț =1

Rule 80 : ț=2 Rule 8 : ț=2

Rule 82 : ț=2 Rule 83 : ț=2

Rule 84 : ț =3 Rule 85 : ț=2

Rule 86 : ț =1 Rule 87 : ț =1

Rule 88 : ț=2 Rule 89 : ț=2

Rule 92 : ț =1 Rule 93 : ț=2

Rule 96 : ț =1 Rule 97 : ț =3

Rule 98 : ț=2 Rule 99 : ț=2

Rule 200 : ț =1 Rule 20 : ț=2

Rule 20 : ț=2 Rule 2 : ț=2

Rule 22 : ț =1 Rule 23 : ț =1

Rule 24 : ț=2 Rule 25 : ț=2

Rule 26 : ț =3 Rule 27 : ț=2

Rule 28 : ț=2 Rule 29 : ț=2

Rule 220 : ț =1 Rule 22 : ț =1

Rule 240 : ț =1 Rule 24 : ț =1

Rule 250 : ț =1 Rule 25 : ț =1