Lenia - Mathematical Life Forms
-
Updated
Jul 19, 2024 - Python
A cellular automaton is a discrete model of computation studied in automata theory.
It consists of a regular grid of cells, each in one of a finite number of states; a new generation is created according to some fixed rule that determines the new state of each cell in terms of the current state of the cell and its neighborhood.
Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the stochastic cellular automaton and asynchronous cellular automaton.
A well-known cellular automaton is Conway’s Game of Life.
Lenia - Mathematical Life Forms
A library for working with Cellular Automata, for Python.
A reproduction of growing neural cellular automata using PyTorch.
A Python Library for Conway's Game of Life
Generates a 2D animation of Rule 30 (or other rules) being fed into Conway's Game of Life.
GUI for glider logic in Conway's game of life.
Cellular Automata Accelerated in JAX (Oral at ICLR 2025).
Predict and analyze cellular automata using convolutional neural networks
Code for "Learning Graph Cellular Automata" (NeurIPS 2021).
A visual programming language, evaluated as a cellular automaton
Simple Python script that generates cellular automata posters as PDF files.
Automata on arbitrary networks, with Python
Official implementation of Generative Cellular Automata: ICLR 2021, 2022 (spotlight)
Conway's Game of Life using python's matplotlib and numpy
Cellular Automata Environments for Reinforcement Learning
A simple python implemenation of John H. Conway's Game of Life that runs in Linux and Windows terminal/console.
GPU-accelerated engine for multi-dimensional cellular automata
A more general Python Cellular Automata with multi-dimensions and multi-cell type mix
Cellular automata search program
Created by Stanisław Ulam, John von Neumann
Released 1940