ruleTransformation = {{0, 1, 0, 0, 0, 1}, {1, 0, 1, 0, 0, 0}, {0, 1,
0, 1, 0, 0}, {0, 0, 1, 0, 1, 0}, {0, 0, 0, 1, 0, 1}, {1, 0, 0, 0,
1, 0}}
lenngth = Dimensions[ruleTransformation][[1]];
Eigenvalues[ruleTransformation]
edge = {};
Do[Do[If[ruleTransformation[[i, j]] == 1,
AppendTo[edge, i -> j]],
{j, 1, lenngth}] ,
{i, 1, lenngth }]
Graph[edge,
VertexLabels -> "Name",
ImagePadding -> 100,
ImageSize -> 500]
TableForm[
Table[{n, Tr[MatrixPower[ruleTransformation, n]]}, {n, 10}],
TableHeadings -> {None, {"n", "Matrix Power"}}]
Therefore the evolution of the matrix..

What about people like me who don't even know any binary? That must be why the Third Law requires an infinite amount of steps in its definition.


Reading your article is like reading the textbook; the cellular automata evolution is like that. Do you want to choose a perturbation?