Encode and decode secret messages in cellular automata.
-
Updated
Mar 6, 2018 - TypeScript
Encode and decode secret messages in cellular automata.
An implementation of conway's game of life using Angular 6.
Webapp that simulate elementary cellular automata
Sam Hogan's Cell Machine, now on MakeCode Arcade!
Cellular Automata demonstration in React.
A cellular automaton is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays.
TypeScript implementation of the Abelian sandpile model, with HTML5 Canvas rendering.
Extensible and efficient web application for exploring cellular automata
Typescript implementation of Conway's Game of Life simulation
Cellular Automata and Conways Game of Life in React
An implementation of Conway's Game of Life in TypeScript
Recreation of the Game of Life by John Conway in JavaScript using React.
Cellular automata with dynamic rulesets in WebGL
Game of life, a cellular automation by J.H. Conway.
Langton's ant simulator with a extensive rules editor.
A cellular automaton playground.
Plant growth simulation by cellular neural network.
🧫 Cellular Automata
Add a description, image, and links to the cellular-automata topic page so that developers can more easily learn about it.
To associate your repository with the cellular-automata topic, visit your repo's landing page and select "manage topics."