Notes - Pages 223-297
Initial conditions
class 1, any initial condition goes to one final state. Class 2 can have structures that can persist but remain local. Class 3 any change in local state gets spread to the entire structure including init conditions. Class 4 similar to class 3 but only if the conditions effect the moving structure, othewise behaves like clas 2
Information
How the initial conditions, or information is spread through the automata can put limits on their structures. Class 2 because information is localized, it must lead to repeated patterns. In fact any bounded automata will show repeat patterns. Class 3 can emulate class 2, and show randomness given sufficiently random initial conditions, structured initial conditions lead to structured output. If class 4 has persistent structures it is likely moving ones can be found
Class System
Simple, any initial condition eventually ends in the same state
Finite set of final states that consists of a set of structure that either repeat every few steps or remain forever
Seemingly random, but structures and patterns are seen throughout
Localized structures that can interact with one another
This chapter had a lot of information on how cellular automata relates to infromation or structure, much of it images that wont be reproduced here. Many of the properties claimed are not supported by proofs, and the author doesnt define randomness in the way I would, if Class 3 is random then it should not have repeated patterns in it, in my opinion there should be no patterns in randomness.