Jean Hardouin-Duparc
| Jean Hardouin-Duparc | |
| Born | Unknown |
|---|---|
| Residence | Unknown |
| Nationality | Unknown |
| Institutions | Université de Bordeaux |
| Alma mater | Unknown |
Jean Hardouin-Duparc pioneered a computational approach to finding Garden of Eden patterns involving the construction of the complement of the language accepted by a nondeterministic finite state machine. This machine recognizes in a row-by-row fashion patterns with a fixed width that have predecessors, so its complement is a regular language describing all Gardens of Eden with that width.[1] In 1973, Hardouin-Duparc used this technique to find the second and third known Gardens of Eden in Conway's Game of Life, which had bounding boxes of size 122 × 6 and 117 × 6. He also proved that every pattern that fits within a bounding box of height one has a parent, i.e. there does not exist a Garden of Eden that has a bounding box with height one.[2]
References
- ↑ Garden of Eden (cellular_automaton) at Wikipedia
- ↑ Nathaniel Johnston, Dave Greene. Conway's Game of Life: Mathematics and Construction (2022), Section 1.7.
External links and further reading
- Hardouin-Duparc, J. (1974), "Paradis terrestre dans l'automate cellulaire de Conway", Rev. Française Automat. Informat. Recherche Operationnelle Ser. Rouge, 8 (R-3): 64–71