Golly_(program)

Golly (program)

Golly (program)

Tool for simulating cellular automata


Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki;[4] it can be scripted using Lua[1] 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,[5] and that is fast enough to simulate some patterns for 232 or more time units.[6] It also includes a large library of predefined patterns in Conway's Game of Life and other rules.[7]

Quick Facts Initial release, Stable release ...

References

  1. "Golly Help: Changes". golly.sourceforge.net. Retrieved 2016-10-02.
  2. Trevorrow, Andrew. "Golly 4.3b1". ConwayLife.com. Retrieved 3 April 2024.
  3. "Golly download". sourceforge.net. Retrieved 2017-07-26.
  4. Delahaye, Jean-Paul (April 2009), "Le royaume du Jeu de la vie" (PDF), Pour la Science (in French): 86–91.
  5. Rendell, P. (2011), "A universal Turing machine in Conway's Game of Life", 2011 International Conference on High Performance Computing and Simulation (HPCS) (PDF), pp. 764–772, doi:10.1109/HPCSim.2011.5999906, S2CID 35957181, archived from the original (PDF) on 2014-03-11, retrieved 2012-12-09
  6. Eppstein, David (2010), "Growth and Decay in Life-Like Cellular Automata", in Andrew Adamatzky (ed.), Game of Life Cellular Automata, Springer, pp. 71–97, arXiv:0911.2890, Bibcode:2010golc.book...71E, doi:10.1007/978-1-84996-217-9_6, ISBN 9781849962179, S2CID 37007937

Share this article:

This article uses material from the Wikipedia article Golly_(program), and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.