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:
“I went to the Garden of Love,
And saw what I never had seen:
A Chapel was built in the midst,
Where I used to play on the green.
And the gates of this Chapel were shut,
And ‘Thou shalt not’ writ over the door;”
—William Blake (1757–1827)
“Everyone is always in favour of general economy and particular expenditure.”
—Anthony, Sir Eden (1897–1977)