Game of life cellular automata
In the late 1960s, British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes t…
Collision based computing
"Presents a unique overview of computation with mobile self-localized patterns in non-linear media, including computation in optical media, mathematical models of massively parallel computers, and molecular systems"--Back cover.
Volume IV continues the author's odyssey on l-D cellular automata as chronicled in Volumes I, II and III by uncovering a novel quasi-ergodicity phenomenon involving orbits meandering among omega-limit orbits of complex (group 5) and hyper (group 6) Bernoulli rules. This discover…
Volume IV continues the author's odyssey on l-D cellular automata as chronicled in Volumes I, II and III by uncovering a novel quasi-ergodicity phenomenon involving orbits meandering among omega-limit orbits of complex (group 5) and hyper (group 6) Bernoulli rules. This discover…
Ch. 1. Quasi-ergodicity. 1. Remembrance of things past. 1.1. Boolean cube representation. 1.2. Index of complexity. 1.3. One formula specifies all 256 rules. 1.4. Space-time pattern and time-[symbol] return maps. 1.5. We only need to study 88 rules! 1.6. The "magic" rule spaces.…
Volume IV continues the author's odyssey on l-D cellular automata as chronicled in Volumes I, II and III, by uncovering a novel quasi-ergodicity phenomenon involving orbits meandering among omega-limit orbits of complex (group 5) and hyper (group 6) Bernoulli rules. This discove…