Problem: Difference between revisions
Jump to navigation
Jump to search
Apple Bottom (talk | contribs) GoE |
Apple Bottom (talk | contribs) It might actually more sense to emphasize open problems, not solved problems. |
||
| Line 25: | Line 25: | ||
! class="unsortable" colspan="6" | Description | ! class="unsortable" colspan="6" | Description | ||
|- | |- | ||
| [[Coolout Conjecture]] || | | [[Coolout Conjecture]] || solved || data-sort-value=1992 | <1992 || [[Richard Schroeppel]] || 2001 || [[Richard Schroeppel]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''given a partial Life pattern that's internally consistent with being part of a still life (stable pattern), is there always a way to add a stabilizing boundary?''” was answered in the negative. | | colspan="6" | The question “''given a partial Life pattern that's internally consistent with being part of a still life (stable pattern), is there always a way to add a stabilizing boundary?''” was answered in the negative. | ||
|- | |- | ||
| [[Garden of Eden]] || | | [[Garden of Eden]] || solved || ? || ? || data-sort-value=1970 | <1970 || [[Edward Moore]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The existence of a [[Garden of Eden]] in [[Conway's Game of Life|Life]] was known from the start because of a theorem by [[Edward Moore]] that guarantees their existence in a wide class of [[cellular automaton|cellular automata]]. | | colspan="6" | The existence of a [[Garden of Eden]] in [[Conway's Game of Life|Life]] was known from the start because of a theorem by [[Edward Moore]] that guarantees their existence in a wide class of [[cellular automaton|cellular automata]]. | ||
|- | |- | ||
| [[Grandfather problem]] || | | [[Grandfather problem]] || solved || 1972 || [[John Conway]] || 2016 || [[mtve]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''is there a configuration which has a father but no grandfather?''” was answered in the affirmative. | | colspan="6" | The question “''is there a configuration which has a father but no grandfather?''” was answered in the affirmative. | ||
|- | |- | ||
| [[Omniperiodicity]] || open || data-sort-value=0 | ? || ? || data-sort-value=0 | — || — | | [[Omniperiodicity]] || '''open''' || data-sort-value=0 | ? || ? || data-sort-value=0 | — || — | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''do [[oscillator]]s of all [[period]]s exist?''” remains open for [[Conway's Game of Life|Life]]; no oscillators are known are [[periods]] 19, 23, 38 and 41, and no non-[[trivial]] oscillators are known for period 34. | | colspan="6" | The question “''do [[oscillator]]s of all [[period]]s exist?''” remains open for [[Conway's Game of Life|Life]]; no oscillators are known are [[periods]] 19, 23, 38 and 41, and no non-[[trivial]] oscillators are known for period 34. | ||
|- | |- | ||
| [[Replicator]]s || | | [[Replicator]]s || solved || data-sort-value=0 | ? || ? || 1982 || [[Elwyn R. Berlekamp]], [[John Conway]], [[Richard K. Guy]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''do [[replicator]]s exist in [[Conway's Game of Life|Life]]?''” was answered in the affirmative.<ref name="winningways" /> | | colspan="6" | The question “''do [[replicator]]s exist in [[Conway's Game of Life|Life]]?''” was answered in the affirmative.<ref name="winningways" /> | ||
|- | |- | ||
| [[Unique father problem]] || open || 1972 || [[John Conway]] || data-sort-value=0 | — || — | | [[Unique father problem]] || '''open''' || 1972 || [[John Conway]] || data-sort-value=0 | — || — | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''is there a stable configuration whose only father is itself?''” remains open. | | colspan="6" | The question “''is there a stable configuration whose only father is itself?''” remains open. | ||
|- | |- | ||
| [[Universal computer]] / [[Universal constructor]] || | | [[Universal computer]] / [[Universal constructor]] || solved || ? || [[John Conway]] || 1982 || [[Elwyn R. Berlekamp]], [[John Conway]], [[Richard K. Guy]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''does [[Conway's Game of Life|Life]] support [[universal computation]] and [[universal construction]]?''” was answered in the affirmative.<ref name="winningways" /> | | colspan="6" | The question “''does [[Conway's Game of Life|Life]] support [[universal computation]] and [[universal construction]]?''” was answered in the affirmative.<ref name="winningways" /> | ||
Revision as of 21:02, 27 August 2017
An open problem is a problem for which no solution has been found. An example is "Do oscillators of all periods exist in Conway's Game of Life?".
Unsolved problems can be subdivided into several basic categories:
- Periods: Do oscillators, spaceships, guns or puffers exist of a particular period?
- Unusual-growth patterns: What is the long-term effect of a predefined pattern? For example, it is unknown whether the Fermat prime calculator grows indefinitely.
- Solvable problems: Some problems are known to have a solution, but as yet no pattern has been built. For instance, no adjustable-speed diagonal spaceship has been built to date, but a workable blueprint is available, and no new technical problems would have to be overcome to complete the construction.
- Construction and destruction problems: These include finding the smallest Garden of Eden, building a stable eater that can absorb any single glider aimed at it, determining whether a particular object has a glider synthesis, or discovering an unstoppable-growth pattern.
- Spatial minimization problems: Find an object that satisfies some criterion that fits within a certain bounding box. Examples include Mike Playle's prize for a small stable reflector.
- Temporal minimization problems: As above, but concentrating on speed rather than size.
List of problems
Open and previously open problems include:
| Problem | Status | Year posed | Posed by | Year solved | Solved by |
|---|---|---|---|---|---|
| Description | |||||
| Coolout Conjecture | solved | <1992 | Richard Schroeppel | 2001 | Richard Schroeppel |
| The question “given a partial Life pattern that's internally consistent with being part of a still life (stable pattern), is there always a way to add a stabilizing boundary?” was answered in the negative. | |||||
| Garden of Eden | solved | ? | ? | <1970 | Edward Moore |
| The existence of a Garden of Eden in Life was known from the start because of a theorem by Edward Moore that guarantees their existence in a wide class of cellular automata. | |||||
| Grandfather problem | solved | 1972 | John Conway | 2016 | mtve |
| The question “is there a configuration which has a father but no grandfather?” was answered in the affirmative. | |||||
| Omniperiodicity | open | ? | ? | — | — |
| The question “do oscillators of all periods exist?” remains open for Life; no oscillators are known are periods 19, 23, 38 and 41, and no non-trivial oscillators are known for period 34. | |||||
| Replicators | solved | ? | ? | 1982 | Elwyn R. Berlekamp, John Conway, Richard K. Guy |
| The question “do replicators exist in Life?” was answered in the affirmative.[1] | |||||
| Unique father problem | open | 1972 | John Conway | — | — |
| The question “is there a stable configuration whose only father is itself?” remains open. | |||||
| Universal computer / Universal constructor | solved | ? | John Conway | 1982 | Elwyn R. Berlekamp, John Conway, Richard K. Guy |
| The question “does Life support universal computation and universal construction?” was answered in the affirmative.[1] | |||||