Golly (program) explained

Golly
Latest Release Version:v5.0
Latest Preview Version:v5.0b1
Programming Language:C++ (wxWidgets)
Operating System:Linux, FreeBSD, OpenBSD, Windows, OS X, iOS, Android
License:GNU GPLv2[1]

Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki;[2] it can be scripted using Lua[3] or Python.It includes a hashlife algorithm that can simulate the behavior of very large structured or repetitive patterns such as Paul Rendell's Life universal Turing machine,[4] and that is fast enough to simulate some patterns for 232 or more time units.[5] It also includes a large library of predefined patterns in Conway's Game of Life and other rules.[6]

Notes and References

  1. Web site: Golly download. sourceforge.net. 2017-07-26.
  2. Le royaume du Jeu de la vie. French. Pour la Science. Jean-Paul. Delahaye. https://web.archive.org/web/20200614085709/http://www.lifl.fr/~jdelahay/dnalor/Jeudelavie.pdf. 2020-06-14. dead. April 2009. 86–91. .
  3. Web site: Golly Help: Changes. golly.sourceforge.net. 2016-10-02.
  4. A universal Turing machine in Conway's Game of Life. 2011 International Conference on High Performance Computing and Simulation (HPCS). 2011. Rendell. P.. 764–772. 10.1109/HPCSim.2011.5999906. 35957181. 2012-12-09. https://web.archive.org/web/20140311164124/http://uncomp.uwe.ac.uk/CAAA2011/Program_files/764-772.pdf. 2014-03-11. dead.
  5. 2009. 15. 3. 351–375. 10.1162/artl.2009.Gotts.009. Ramifying feedback networks, cross-scale interactions, and emergent quasi individuals in Conway's Game of Life. Nicholas M.. Gotts. Artificial Life. 19254180. 16527203. .
  6. Book: Eppstein, David . David Eppstein

    . Game of Life Cellular Automata . Growth and Decay in Life-Like Cellular Automata . David Eppstein . . 71–97 . 2010 . . 10.1007/978-1-84996-217-9_6 . 9781849962179. 0911.2890 . 2010golc.book...71E . 37007937 .