Garden Of Eden (cellular Automaton)
In a cellular automaton, a Garden of Eden configuration is a configuration that cannot appear on the lattice after one time step, no matter what the initial configuration. In other words, these are the configurations with no predecessors.
They resemble the concept of the Garden of Eden in Abrahamic religions, which was created out of nowhere, hence the name. According to Moore (1962), this name was coined by John Tukey in the 1950s.
A Garden of Eden is a configuration of the whole lattice (usually a one- or two-dimensional infinite square lattice). Each Garden of Eden configuration contains at least one finite pattern (an assignment of states to a finite subset of the cells) that has no predecessor regardless of how the surrounding cells are filled. Such a pattern is called an orphan. Alternatively, an orphan is a finite pattern such that each configuration containing that pattern is a Garden of Eden.
Read more about Garden Of Eden (cellular Automaton): Searching For The Garden of Eden, The Garden of Eden Theorem, In Fiction
Famous quotes containing the words garden and/or eden:
“These are thy wonders, Lord of love,
To make us see we are but flowers that glide.
Which when we once can finde and prove,
Thou hast a garden for us where to bide.”
—George Herbert (1593–1633)
“For sometimes it is shown to me in dreams
The Eden that all wish to recreate
Out of their living, from their favourite times;
The miraculous play where all their dead take part,
Once more articulate....”
—Philip Larkin (1922–1986)