Golly (program) explained

Golly
Latest Release Version:v4.3
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, 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 Conway's Game of Life and other rules.

Notes and References

  1. Web site: Golly download. sourceforge.net. 2017-07-26.
  2. .
  3. Web site: Golly Help: Changes. golly.sourceforge.net. 2016-10-02.
  4. .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Golly (program)".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.