| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
In the study of cellular automata, a Garden of Eden pattern is a configuration that is not reached from any other starting configuration. That is, there is no possible predecessor configuration that evolves into the Garden of Eden configuration.
These configurations were christened as such before Conway's Game of Life, by John Tukey.
Let some configuration at timestep t be denoted by Ct, and the function (the automaton) f to map the configuration Ct to Ct+1.
A Garden of Eden pattern Gt means that there does not exist any configuration Gt-1 such that f(Gt-1)=Gt. This means that the automaton is not surjective.
Garden of Eden patterns are not unique.