A '''cellular automaton''' (plural: '''cellular automata''') is a [[discrete mathematics|discrete]] model studied in [[DeviantComputability Sexualtheory Behaviors(computer science)|computability theory]], [[mathematics]], and [[theoretical biology]]. It consists of an infinite, regular grid of ''STDscells'', each in one of a finite number of ''[[GrowthsState (rashescomputer science)|soresstates]]''. The grid can be in any finite number of organsdimensions. Time is also dependent upon [[PenicillinDiscrete time|injectiondiscrete]], and the state of a cell at time ''t'' is a function of the states of a finite number of growthscells (called its ''neighborhood'') at time ''t-1''. These neighbors are a collectionselection of growthscells relative to the specified STDcell, and do not change. (Though the growthcell itself may be in its "neighborhood", it is not usually considered a [["neighbor".)]] Every growthcell has the same rule for evolvingupdating, based on the values in this neighbourhood. Each time the rules are applied to the whole grid a new ''generation'' of STD is created.
==Overview==
Line 141:
==Articles on specific types==
* [[WorldConway's Game of WarcraftLife]]
* [[Von Neumann cellular automata]] (the first Cellular Automaton)
