Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
DroneBetter (talk | contribs) reword part created prior to creation of DOGun SaGaQR, add categorisation column, minimal-population infinite growth, universality of predecessor-finding, glider-proof object problem (easier (and slightly less probably-negative) version of immovable object problem, from example in introductory section) |
||
| Line 6: | Line 6: | ||
* ''Periods'': Do [[oscillator]]s, [[spaceship]]s, [[gun]]s or [[puffer]]s exist of a particular [[period]]? | * ''Periods'': Do [[oscillator]]s, [[spaceship]]s, [[gun]]s or [[puffer]]s 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. | * ''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, | * ''Solvable problems:'' Some problems are known to have a solution, but as yet no pattern has been built. For instance, until [[DOGun SaGaQR]], no [[Quadratic replicator|quadratic growth replicator]] had been constructed, but a [https://conwaylife.com/forums/viewtopic.php?f=2&t=1641&start=50#p44985 workable blueprint] was available, and no really large new technical problems would have had 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 [[IceNine|unstoppable-growth pattern]]. | * ''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 [[IceNine|unstoppable-growth pattern]]. | ||
* '' | * ''Minimization problems:'' Find an object that satisfies some criterion that fits within a certain [[bounding box]]/[[minimum population]]. Examples include [[Mike Playle]]'s prize for a small [[stable reflector]]. | ||
* ''Temporal minimization problems:'' As above, but concentrating on speed rather than size. | :* ''Temporal minimization problems:'' As above, but concentrating on speed rather than size. | ||
==List of problems== | ==List of problems== | ||
| Line 15: | Line 15: | ||
{| class="sortable wikitable" style="margin-left: auto; margin-right: auto" | {| class="sortable wikitable" style="margin-left: auto; margin-right: auto" | ||
|- | |- | ||
! data-sort-type="text" | Category | |||
! data-sort-type="text" | Problem | ! data-sort-type="text" | Problem | ||
! data-sort-type="text" | Status | ! data-sort-type="text" | Status | ||
| Line 24: | Line 25: | ||
! class="unsortable" colspan="6" | Description | ! class="unsortable" colspan="6" | Description | ||
|- | |- | ||
| | | Infinite growth || [[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 “'' | | || colspan="6" | The question “''do replicators exist in Conway's Game of Life?''” was answered in the affirmative.<ref name="winningways" /> | ||
|- | |- | ||
| | | Infinite growth || Minimal-population infinite growth || solved || data-sort-value=0 | ? || ? || 1997 || [[Paul Callahan]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question | | || colspan="6" | The question "''What is the minimum population necessary for a pattern to exhibit infinite growth?''" was found to be 10 cells by an exhaustive search.<ref>{{LinkForumThread|f=2|t=3604|format=ref|title=Systematic survey of small patterns|author=Nick Gotts|date=November 28, 2018}}</ref> There are 24 such patterns, with 17 unique evolution sequences. (The equivalent question for quadratic growth is thus between 11 and [[20-cell quadratic growth|20]].) | ||
|- | |- | ||
| | | Infinite growth || One cell thick infinite growth || solved || ? || [[Nick Gotts]] || 1998 || [[Stephen Silver]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | | | || colspan="6" | The question “''is there a [[one-cell-thick pattern]] exhibiting [[infinite growth]]?''” [[1×N quadratic growth|was answered in the affirmative]]. | ||
|- | |- | ||
| [[ | | Still lifes || [[Coolout Conjecture]] || solved || data-sort-value=1992 | <1992 || [[Richard Schroeppel]] || 2001 || [[Richard Schroeppel]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The | | || 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. | ||
|- | |- | ||
| | | Still lifes || Still life finitization problem || '''open''' || data-sort-value=0 | ? || [[Dean Hickerson]] || data-sort-value=0 | — || — | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question | | || colspan="6" | The question "''given a still life without finite boundaries, can any MxN finite window of it be preserved within a finite still life by adding appropriate unchanging cells around it?''" remains open. It has been shown that the margin around a window needed to stabilise it might be arbitrarily large.<ref name="post86644" /> | ||
|- | |- | ||
| [[Omniperiodicity]] || solved || data-sort-value=0 | ? || ? || data-sort-value=0 | 2023 || various people | | Oscillators || [[Omniperiodicity]] || solved || data-sort-value=0 | ? || ? || data-sort-value=0 | 2023 || various people | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “''do oscillators of all periods exist?''” has been answered in the affirmative. | | || colspan="6" | The question “''do oscillators of all periods exist?''” has been answered in the affirmative. | ||
|- | |- | ||
| [[ | | Oscillators || Non-p2 [[phoenix]] || solved || data-sort-value=0 | ? || ? || 2024 || [[Adam P. Goucher]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “'' | | || colspan="6" | The question “''Does there exist a finite oscillator of period > 2 such that no cell remains on contiguously for more than one generation?''” was answered in the negative.<ref name="every-finite-phoenix-has-period-2" /> (The question for infinite agars and wicks was previously answered in the affirmative.) | ||
|- | |||
| Predecessors || [[Garden of Eden]] || solved || ? || ? || data-sort-value=1970 | <1970 || [[Edward Moore]] | |||
|- class="expand-child" | |||
| || colspan="6" | The existence of a Garden of Eden in [[Conway's Game of Life]] was known from the start because of a 1962 theorem by [[Edward Moore]] that guarantees their existence in a wide class of [[cellular automata]]. | |||
|- | |||
| Predecessors || [[Grandfather problem]] || solved || 1972 || [[John Conway]] || 2016 || [[mtve]] | |||
|- class="expand-child" | |||
| || colspan="6" | The question “''is there a configuration which has a father but no grandfather?''” was answered in the affirmative. | |||
|- | |- | ||
| | | Predecessors || [[Unique father problem]] || solved || 1972 || [[John Conway]] || data-sort-value=0 | 2022 || [[Ilkka Törmä]], [[Ville Salo]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question | | || colspan="6" | The question “''is there a stable configuration whose only father is itself?''” was answered in the affirmative.<ref name="post140258" /> | ||
|- | |- | ||
| [[ | | Computation || [[Universal computer]] / [[Universal constructor]] || solved || data-sort-value=0 | ? || [[John Conway]] || 1982 || [[Elwyn R. Berlekamp]], [[John Conway]], [[Richard K. Guy]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question “'' | | || colspan="6" | The question “''does Conway's Game of Life support universal computation and universal construction?''” was answered in the affirmative.<ref name="winningways" /> | ||
|- | |- | ||
| | | Computation || Universality of predecessor-finding || solved || data-sort-value=0 | ? || ? || 2023 || [[Ville Salo]] and [[Ilkka Törmä]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | The question | | || colspan="6" | The question "''can problems of finding predecessors of specific patterns be equivalent to arbitrary [[Boolean satisfiability problem]]s?''" was answered in the affirmative, with the corollary that the process of reversing a single iteration (or otherwise proving that a pattern is a [[Garden of Eden]]) is computationally universal.<ref name="arxiv2308.10198" /> | ||
|- | |- | ||
| | | Circuitry || Small [[glider]] [[reflector]] / [[duplicator]] || '''open''' || 2013, 2020 || [[Mike Playle]] || data-sort-value=0 | — || — | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | | | || colspan="6" | After the discovery of the [[color-preserving]] [[Snark]] in {{year|2013}}, Mike Playle offered 100 USD for ''a stable 90-degree colour-changing glider reflector that fits in a 25x25 bounding box and has a repeat time of 50 generations or less''.<ref name="post7843" /> When the 0-degree [[Bandersnatch]] was found in {{year|2020}}, he released another prize of 200 USD for ''a stable pattern which fits in a 25x25 bounding box, has a repeat time of 50 generations or less, and produces two output gliders that emerge in different directions'' and do not affect input gliders from infinity.<ref name="post103850" /> | ||
|- | |- | ||
| | | Agar crawlers || Bound-height lightspeed bubbles || solved || data-sort-value=0 | ? || ? || 2017 || [[Arie Paap]] | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | | | || colspan="6" | The question "''Does there exist an <tt>n</tt> such that a [[lightspeed bubble]] containing an empty region of any width may be constructed with height <tt>≤ n</tt>?''" was answered in the positive, with <tt>n ≤ 37</tt>.<ref name="post40615" /> | ||
|- | |||
| Indestructibility || The Immovable Object Problem || '''open''' || 1972 || [[John Conway]] || data-sort-value=0 | — || — | |||
|- class="expand-child" | |||
| || colspan="6" | Does there exist a bounded pattern such that the central cell will never change state no matter what is placed outside the pattern's boundary? | |||
|- | |- | ||
| | | Indestructibility || The Glider-Proof Object Problem || '''open''' || data-sort-value=0 | ? || ? || data-sort-value=0 | — || — | ||
|- class="expand-child" | |- class="expand-child" | ||
| colspan="6" | | | || colspan="6" | Does there exist a bounded pattern such that a collision with a nonempty glider approaching from infinity (at any direction and offset) results in the glider's destruction and the pattern's eventual evolution being unaffected? | ||
|} | |} | ||
| Line 128: | Line 140: | ||
}}</ref> | }}</ref> | ||
<ref name="every-finite-phoenix-has-period-2">Adam P. Goucher (January 20, 2024), [https://cp4space.hatsya.com/2024/01/20/every-finite-phoenix-has-period-2/ Every finite phoenix has period 2], ''Complex Projective 4-Space''</ref> | <ref name="every-finite-phoenix-has-period-2">Adam P. Goucher (January 20, 2024), [https://cp4space.hatsya.com/2024/01/20/every-finite-phoenix-has-period-2/ Every finite phoenix has period 2], ''Complex Projective 4-Space''</ref> | ||
<ref name="arxiv2308.10198">[[Ville Salo]], [[Ilkka Törmä]] (August 20, 2023), [https://arxiv.org/abs/2308.10198 ''Computing backwards with Game of Life, part 1: wires and circuits'']</ref> | |||
</references> | </references> | ||
Revision as of 04:08, 21 January 2024
An open problem is a problem for which no solution has been found. A former 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, until DOGun SaGaQR, no quadratic growth replicator had been constructed, but a workable blueprint was available, and no really large new technical problems would have had 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.
- Minimization problems: Find an object that satisfies some criterion that fits within a certain bounding box/minimum population. 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:
| Category | Problem | Status | Year posed | Posed by | Year solved | Solved by |
|---|---|---|---|---|---|---|
| Description | ||||||
| Infinite growth | Replicators | solved | ? | ? | 1982 | Elwyn R. Berlekamp, John Conway, Richard K. Guy |
| The question “do replicators exist in Conway's Game of Life?” was answered in the affirmative.[1] | ||||||
| Infinite growth | Minimal-population infinite growth | solved | ? | ? | 1997 | Paul Callahan |
| The question "What is the minimum population necessary for a pattern to exhibit infinite growth?" was found to be 10 cells by an exhaustive search.[2] There are 24 such patterns, with 17 unique evolution sequences. (The equivalent question for quadratic growth is thus between 11 and 20.) | ||||||
| Infinite growth | One cell thick infinite growth | solved | ? | Nick Gotts | 1998 | Stephen Silver |
| The question “is there a one-cell-thick pattern exhibiting infinite growth?” was answered in the affirmative. | ||||||
| Still lifes | 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. | ||||||
| Still lifes | Still life finitization problem | open | ? | Dean Hickerson | — | — |
| The question "given a still life without finite boundaries, can any MxN finite window of it be preserved within a finite still life by adding appropriate unchanging cells around it?" remains open. It has been shown that the margin around a window needed to stabilise it might be arbitrarily large.[3] | ||||||
| Oscillators | Omniperiodicity | solved | ? | ? | 2023 | various people |
| The question “do oscillators of all periods exist?” has been answered in the affirmative. | ||||||
| Oscillators | Non-p2 phoenix | solved | ? | ? | 2024 | Adam P. Goucher |
| The question “Does there exist a finite oscillator of period > 2 such that no cell remains on contiguously for more than one generation?” was answered in the negative.[4] (The question for infinite agars and wicks was previously answered in the affirmative.) | ||||||
| Predecessors | Garden of Eden | solved | ? | ? | <1970 | Edward Moore |
| The existence of a Garden of Eden in Conway's Game of Life was known from the start because of a 1962 theorem by Edward Moore that guarantees their existence in a wide class of cellular automata. | ||||||
| Predecessors | 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. | ||||||
| Predecessors | Unique father problem | solved | 1972 | John Conway | 2022 | Ilkka Törmä, Ville Salo |
| The question “is there a stable configuration whose only father is itself?” was answered in the affirmative.[5] | ||||||
| Computation | Universal computer / Universal constructor | solved | ? | John Conway | 1982 | Elwyn R. Berlekamp, John Conway, Richard K. Guy |
| The question “does Conway's Game of Life support universal computation and universal construction?” was answered in the affirmative.[1] | ||||||
| Computation | Universality of predecessor-finding | solved | ? | ? | 2023 | Ville Salo and Ilkka Törmä |
| The question "can problems of finding predecessors of specific patterns be equivalent to arbitrary Boolean satisfiability problems?" was answered in the affirmative, with the corollary that the process of reversing a single iteration (or otherwise proving that a pattern is a Garden of Eden) is computationally universal.[6] | ||||||
| Circuitry | Small glider reflector / duplicator | open | 2013, 2020 | Mike Playle | — | — |
| After the discovery of the color-preserving Snark in 2013, Mike Playle offered 100 USD for a stable 90-degree colour-changing glider reflector that fits in a 25x25 bounding box and has a repeat time of 50 generations or less.[7] When the 0-degree Bandersnatch was found in 2020, he released another prize of 200 USD for a stable pattern which fits in a 25x25 bounding box, has a repeat time of 50 generations or less, and produces two output gliders that emerge in different directions and do not affect input gliders from infinity.[8] | ||||||
| Agar crawlers | Bound-height lightspeed bubbles | solved | ? | ? | 2017 | Arie Paap |
| The question "Does there exist an n such that a lightspeed bubble containing an empty region of any width may be constructed with height ≤ n?" was answered in the positive, with n ≤ 37.[9] | ||||||
| Indestructibility | The Immovable Object Problem | open | 1972 | John Conway | — | — |
| Does there exist a bounded pattern such that the central cell will never change state no matter what is placed outside the pattern's boundary? | ||||||
| Indestructibility | The Glider-Proof Object Problem | open | ? | ? | — | — |
| Does there exist a bounded pattern such that a collision with a nonempty glider approaching from infinity (at any direction and offset) results in the glider's destruction and the pattern's eventual evolution being unaffected? | ||||||
References
- ↑ 1.0 1.1 Berlekamp, Elwyn R.; Conway, John H.; Guy, Richard K. (2004), Winning Ways for Your Mathematical Plays, 4 (2nd ed.), pp. 927-961
- ↑ Nick Gotts (November 28, 2018). Systematic survey of small patterns (discussion thread) at the ConwayLife.com forums
- ↑ Martin Grant (December 28, 2019). Re: Unproven conjectures (discussion thread) at the ConwayLife.com forums
- ↑ Adam P. Goucher (January 20, 2024), Every finite phoenix has period 2, Complex Projective 4-Space
- ↑ Ilkka Törmä (January 13, 2022). Re: Unproven conjectures (discussion thread) at the ConwayLife.com forums
- ↑ Ville Salo, Ilkka Törmä (August 20, 2023), Computing backwards with Game of Life, part 1: wires and circuits
- ↑ Mike Playle (April 27, 2013). Re: Just the place for a Snark! (discussion thread) at the ConwayLife.com forums
- ↑ Mike Playle (September 11, 2020). Re: Execution of Old Guns by Variable-Speed Firing Squad (discussion thread) at the ConwayLife.com forums
- ↑ Arie Paap (February 15, 2017). Re: How about searching light speed signals with various speed? (discussion thread) at the ConwayLife.com forums
External links
- Unproven conjectures (discussion thread) at the ConwayLife.com forums
- Life has been proven omniperiodic. What next? (discussion thread) at the ConwayLife.com forums