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...

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...

A second-order cellular automaton is a type of reversible cellular automaton (CA) invented by Edward Fredkin where the state of a cell at time t depends...

In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot...

experiment of 1867 Reverse computation Reversible cellular automaton – Cellular automaton that can be run backwards Reversible dynamics – Type of physical or...

A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced...

Critters is a reversible block cellular automaton with similar dynamics to Conway's Game of Life, first described by Tommaso Toffoli and Norman Margolus...

a cellular automaton is reversible globally if and only if it is reversible at the block level. The ease of designing reversible block cellular automata...

Canadian-American physicist and computer scientist, known for his work on cellular automata and reversible computing. He is a research affiliate with the Computer Science...

(asymptotical) stability of motion? Is every reversible cellular automaton in three or more dimensions locally reversible? Sudoku: How many puzzles have exactly...