A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it consists of a regular grid of cells, each of which may take on one of a finite set of states, together with a rule for updating all cells simultaneously based on the states of the neighboring cells, in such a way that the state of each cell prior to an update can be determined uniquely from the updated states of all the cells. The time-reversed dynamics of a reversible cellular automaton can always be described by another cellular automaton rule, possibly on a much larger neighborhood. Read more
No comments:
Post a Comment