Reversible cellular automaton
id:
reversible-cellular-automaton-164-17535273
title:
Reversible cellular automaton
text:
A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells, each containing a state drawn from a finite set of states, with a rule for updating all cells simultaneously based on the states of their neighbors, such that the previous state of any cell before 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
brand slug:
wiki
category slug:
encyclopedia
description:
Cellular automaton that can be run backwards
original url:
https://en.wikipedia.org/wiki/Reversible_cellular_automaton
date created:
2011-02-06T08:39:49Z
date modified:
2024-08-29T05:00:16Z
main entity:
{"identifier":"Q7318293","url":"https://www.wikidata.org/entity/Q7318293"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d8/Rectangular_band_cellular_automaton.svg","width":450,"height":288}
fields total:
13
integrity:
16