Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki; it can be scripted using Lua 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, and that is fast enough to simulate some patterns for 232 or more time units. It also includes a large library of predefined patterns in Conway's Game of Life and other rules.
External links
References
Delahaye, Jean-Paul (April 2009), "Le royaume du Jeu de la vie" (PDF), Pour la Science (in French): 86–91. http://www.lifl.fr/~jdelahay/dnalor/Jeudelavie.pdf ↩
"Golly Help: Changes". golly.sourceforge.net. Retrieved 2016-10-02. http://golly.sourceforge.net/Help/changes.html ↩
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 https://web.archive.org/web/20140311164124/http://uncomp.uwe.ac.uk/CAAA2011/Program_files/764-772.pdf ↩
Gotts, Nicholas M. (2009), "Ramifying feedback networks, cross-scale interactions, and emergent quasi individuals in Conway's Game of Life" (PDF), Artificial Life, 15 (3): 351–375, doi:10.1162/artl.2009.Gotts.009, PMID 19254180, S2CID 16527203. http://cranemtn.com/life/files/gotts-cross-scale-AL-draft.pdf ↩
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 9781849962179 ↩