https://github.com/lucasmmg1/elementarycellularautomata
This is a elementary cellular automata theory representation made in processing!
https://github.com/lucasmmg1/elementarycellularautomata
automata ca cellular elementary java processing wolfram
Last synced: 6 months ago
JSON representation
This is a elementary cellular automata theory representation made in processing!
- Host: GitHub
- URL: https://github.com/lucasmmg1/elementarycellularautomata
- Owner: lucasmmg1
- Created: 2025-04-21T00:34:03.000Z (6 months ago)
- Default Branch: main
- Last Pushed: 2025-04-21T02:20:47.000Z (6 months ago)
- Last Synced: 2025-04-22T14:09:59.347Z (6 months ago)
- Topics: automata, ca, cellular, elementary, java, processing, wolfram
- Language: Processing
- Homepage:
- Size: 29.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Elementary cellular automata
This is a visual representation of Wolfram's CA rules.
Theory
Elementary cellular automata (ECAs) are a class of simple mathematical models used to study complex systems and patterns. They consist of a grid of cells, where each cell can be in one of two states (typically 0 or 1). The state of a cell in the next time step depends on its current state and the states of its two neighboring cells, according to a set of rules. There are 256 possible rule sets in ECAs, and despite their simplicity, these automata can generate a wide variety of complex and interesting patterns, making them a valuable tool in the study of self-organization and emergent behavior.
How to use
In order to change the current CA, just change the RULESET_ID variable to a value between 0 and 256.
