![]() | Garden of Eden (cellular automaton) has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: May 20, 2019. ( Reviewed version). |
![]() | This article is substantially duplicated by a piece in an external publication. Please do not flag this article as a copyright violation of the following source: |
![]() | A fact from Garden of Eden (cellular automaton) appeared on Wikipedia's
Main Page in the
Did you know column on 23 June 2019 (
check views). The text of the entry was as follows:
| ![]() |
![]() | This article is rated GA-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
![]() Archives ( Index) |
This page is archived by
ClueBot III.
|
The consensus is that the version that starts more simply and is deliberately redundant is preferable to the the irredundant version. Cunard ( talk) 22:27, 3 July 2016 (UTC)
Which version of the lead (specifically, the first part of the lead, giving the definitions of a Garden of Eden and of an orphan) is better: the irredundant version or the version that starts more simply and is deliberately redundant? Secondarily, it would also be useful to get more opinions on whether the other cellular automaton terminology introduced in the lead and primarily covered by this article ("orphan", "twin", and/or "Garden of Eden theorem") should be boldfaced. — David Eppstein ( talk) 20:19, 31 May 2016 (UTC)
In a cellular automaton, a Garden of Eden is a pattern of the whole lattice of its cells that has no predecessor in any possible evolution of the automaton. John Tukey, who first conjectured existence of these patterns, named them after the Garden of Eden in Abrahamic religions, which was created out of nowhere.[2]
An finite subpattern of the whole (infinite) lattice is called an orphan if any pattern that contains the subpattern is a Garden of Eden. And conversely, it is proven that each Garden of Eden contains at least one orphan.
For one-dimensional cellular automata, orphans and Gardens of Eden can be found by an efficient algorithm, but for higher dimensions this is an undecidable problem. Computer searches have succeeded in finding these Gardens of Eden in Conway's Game of Life. The Garden of Eden theorem of Moore and Myhill states that a cellular automata on the square grid, or on a tiling of any higher dimensional Euclidean space, has a Garden of Eden if and only if it has twins, two finite patterns that have the same successors whenever one is substituted for the other.
<em>...</em>
markup. --
Mark viking (
talk)
21:15, 1 June 2016 (UTC)Maproom Sorry to be so long. (RL). I have made a start and will present something maybe tonight. Question: I cannot find any general use of teh term "quiescent" and the description in the body is opaque. Help anyone? JonRichfield ( talk) 09:07, 21 June 2016 (UTC)
Maproom and David Eppstein Thanks for assistance and patience, and apologies for being so long getting underway. I have begun some proposed material that, to avoid cluttering the present talk page, I have saved in User:JonRichfield/Garden of Eden (cellular automaton). You are welcome to visit and to edit if desired, or take parts of it, modified according to taste. Note that some of the changes amount to the same material reworded or redistributed. For example, the lede would be much smaller because it currently contains material that would be of no value to a reader unfamiliar with the topic who first wishes to know whether it looks worthwhile to read on. I have only the introductory sections so far (and as yet needing a lot of editing; I am a slow writer) because there is no point creating essentially a new article without knowing what its reception would be. JonRichfield ( talk) 19:29, 22 June 2016 (UTC)
![]() | Garden of Eden (cellular automaton) has been listed as one of the
Mathematics good articles under the
good article criteria. If you can improve it further,
please do so. If it no longer meets these criteria, you can
reassess it. Review: May 20, 2019. ( Reviewed version). |
![]() | This article is substantially duplicated by a piece in an external publication. Please do not flag this article as a copyright violation of the following source: |
![]() | A fact from Garden of Eden (cellular automaton) appeared on Wikipedia's
Main Page in the
Did you know column on 23 June 2019 (
check views). The text of the entry was as follows:
| ![]() |
![]() | This article is rated GA-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
|
![]() Archives ( Index) |
This page is archived by
ClueBot III.
|
The consensus is that the version that starts more simply and is deliberately redundant is preferable to the the irredundant version. Cunard ( talk) 22:27, 3 July 2016 (UTC)
Which version of the lead (specifically, the first part of the lead, giving the definitions of a Garden of Eden and of an orphan) is better: the irredundant version or the version that starts more simply and is deliberately redundant? Secondarily, it would also be useful to get more opinions on whether the other cellular automaton terminology introduced in the lead and primarily covered by this article ("orphan", "twin", and/or "Garden of Eden theorem") should be boldfaced. — David Eppstein ( talk) 20:19, 31 May 2016 (UTC)
In a cellular automaton, a Garden of Eden is a pattern of the whole lattice of its cells that has no predecessor in any possible evolution of the automaton. John Tukey, who first conjectured existence of these patterns, named them after the Garden of Eden in Abrahamic religions, which was created out of nowhere.[2]
An finite subpattern of the whole (infinite) lattice is called an orphan if any pattern that contains the subpattern is a Garden of Eden. And conversely, it is proven that each Garden of Eden contains at least one orphan.
For one-dimensional cellular automata, orphans and Gardens of Eden can be found by an efficient algorithm, but for higher dimensions this is an undecidable problem. Computer searches have succeeded in finding these Gardens of Eden in Conway's Game of Life. The Garden of Eden theorem of Moore and Myhill states that a cellular automata on the square grid, or on a tiling of any higher dimensional Euclidean space, has a Garden of Eden if and only if it has twins, two finite patterns that have the same successors whenever one is substituted for the other.
<em>...</em>
markup. --
Mark viking (
talk)
21:15, 1 June 2016 (UTC)Maproom Sorry to be so long. (RL). I have made a start and will present something maybe tonight. Question: I cannot find any general use of teh term "quiescent" and the description in the body is opaque. Help anyone? JonRichfield ( talk) 09:07, 21 June 2016 (UTC)
Maproom and David Eppstein Thanks for assistance and patience, and apologies for being so long getting underway. I have begun some proposed material that, to avoid cluttering the present talk page, I have saved in User:JonRichfield/Garden of Eden (cellular automaton). You are welcome to visit and to edit if desired, or take parts of it, modified according to taste. Note that some of the changes amount to the same material reworded or redistributed. For example, the lede would be much smaller because it currently contains material that would be of no value to a reader unfamiliar with the topic who first wishes to know whether it looks worthwhile to read on. I have only the introductory sections so far (and as yet needing a lot of editing; I am a slow writer) because there is no point creating essentially a new article without knowing what its reception would be. JonRichfield ( talk) 19:29, 22 June 2016 (UTC)