3 5 Cellular Automata

//3 5 Cellular Automata

3 5 Cellular Automata

“A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays.” Wikipedia

Source:
Scott Page Model Thinking MOOC Course

2018-09-24T06:47:13+00:00