70 likes | 74 Views
Substitution Systems and Sequential Substitution Systems. Substitution Systems. On each step, replaces one cell with 0 or more other cells, depending on the state of the neighborhood Number of cells is not constant, as in CA’s Depending on rules, may grow exponentially This gets “unwieldy”.
E N D
Substitution Systems • On each step, replaces one cell with 0 or more other cells, depending on the state of the neighborhood • Number of cells is not constant, as in CA’s • Depending on rules, may grow exponentially • This gets “unwieldy”
Representations • Cells are still colored blocks • CA: Each Cell is the same size • SS: Cells of the next step are divided into pieces of the previous state, to prevent unwieldiness • Nested Structure • Trees
More complicated… • Systems that rely on more than self state • Rules that allow cells to disappear • More than 2 states • As complex as CAs
Sequential-Ness • So far, the substitutions are in parallel • What if we do it serially? • And what if we had characters instead of blocks? • sequential substitution system
Relation to CAs • Cellular Automata is a subset of substitution systems • If all substitutions are 1 and only one cell • Therefore, they are of the same complexity
Real World: Bio Computing • Word processors • Prolog