A cellular automaton (plural: cellular automata or CA) is a discrete computational model consisting of a regular grid of “cells,” each in one of a finite number of states (like on/off or alive/dead). The states of all cells update simultaneously at discrete time steps according to local, deterministic rules based on the states of neighboring cells.
The phrase “Five Cellular Automata” specifically references a well-known legacy computer program and algorithmic suite developed by Rudy Rucker and Hermetic Systems. This suite highlights five mathematically distinct types of cellular automata that simulate everything from biological reproduction to physical and chemical reactions. 1. q-State Life (Extended Conway’s Life)
This automaton expands on John Conway’s legendary Game of Life. Instead of having only two states (binary 0 or 1 for dead or alive), cells can exist in distinct color states.
Software for exploring five cellular automata – Hermetic Systems
Leave a Reply