Rule 023

1 - Matrix

for n=7
c=0c=1

2 - Number of different rows and columns

For different center values 0 and 1, and for different n=1,2,..,12.


(r0) 2 3 4 5 6 7 8 9 10 11 12 13
(c0) 2 3 4 5 6 7 8 9 10 11 12 13
(r1) 2 3 4 5 6 7 8 9 10 11 12 13
(r1) 2 3 4 5 6 7 8 9 10 11 12 13

Maximal of the numbers above (dn)

3 - Time evolution diagram


Time goes upwards. The values of the initial configuration can be changed by clicking on the bottom row. A grey cell means that its value is not specified.

4 - Local rule

A dot stands for an unspecified cell.
 
 1	 0	 0	 .	 .	 .	 1	 .	 .
000	011	110	01.	0..	1.0	.00	.10	..0
								
 1	 1	 0	 1	 .	 0	 .	 0	 .
001	100	111	0.0	10.	1.1	.01	.11	..1
								
 1	 0	 1	 .	 0	 .	 .	 .	 .
010	101	00.	0.1	11.	1..	.0.	.1.	...
								

5 - Sensitivity


The sensibility of a cell is computed as follows. For every row n in the diagram, the upper center cell depends on the 2n+1 cells of row n. Let w in {0,1}2n+1 be a bit string with a single 1, selecting a cell. We compute the proportion of bitstrings u in {0,1}2n+1 such that fn(u) =/= fn(u and w). If it is 0, we color the cell yellow, otherwise we choose a color between red and black depending on the proportion, 1 beeing black.

6 - Symetric rules

reflexive 23
conjugate 23
reflexive conjugate 23