セル・オートマトン
1. Cellular automatonA cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. It consists of a regular grid of cells, each in one of a finite number of states, such as "On" and "Off" (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions.
Read “Cellular automaton” on English Wikipedia
Read “セル・オートマトン” on Japanese Wikipedia
Read “Cellular automaton” on DBpedia
Read “Cellular automaton” on English Wikipedia
Read “セル・オートマトン” on Japanese Wikipedia
Read “Cellular automaton” on DBpedia
Discussions
Log in to talk about this word.