Golly (program)

Screenshot of Golly running a Life universal Turing machine

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

References

  1. ↑ Delahaye, Jean-Paul (April 2009), "Le royaume du Jeu de la vie" (PDF), Pour la Science (in French): 86–91.
  2. ↑ "Golly Help: Changes". golly.sourceforge.net. Retrieved 2016-10-02.
  3. ↑ 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
  4. ↑ 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.
  5. ↑ Eppstein, David (2010), "Growth and Decay in Life-Like Cellular Automata", in Andrew Adamatzky, Game of Life Cellular Automata, Springer, pp. 71–97, arXiv:0911.2890Freely accessible, ISBN 9781849962179

External links

This article is issued from Wikipedia - version of the 10/2/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.