Golly (program)
Screenshot of Golly | |
Initial release | July 2005 [1] |
---|---|
Stable release |
v2.8
/ August 2016[1] |
Repository |
sourceforge |
Written in | C++ (wxWidgets) |
Operating system | Linux, FreeBSD, OpenBSD, Windows, OS X, iOS, Android |
License | GNU GPLv2[2] |
Website |
golly |
Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki;[3] 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,[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]
References
- 1 2 3 "Golly Help: Changes". golly.sourceforge.net. Retrieved 2016-10-02.
- ↑ "Golly download". sourceforge.net. Retrieved 2017-07-26.
- ↑ Delahaye, Jean-Paul (April 2009), "Le royaume du Jeu de la vie" (PDF), Pour la Science (in French): 86–91.
- ↑ 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
- ↑ Gotts, Nicholas M. (2009), Ramifying feedback networks, cross-scale interactions, and emergent quasi individuals in Conway's Game of Life (PDF), 15 (3), pp. 351–375, doi:10.1162/artl.2009.Gotts.009.
- ↑ Eppstein, David (2010), "Growth and Decay in Life-Like Cellular Automata", in Andrew Adamatzky, Game of Life Cellular Automata, Springer, pp. 71–97, ISBN 9781849962179, arXiv:0911.2890
External links
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.