cellular automaton
A computational model of a grid of cells evolving by simple local rules, used here as an example of a self-consistent alternative 'universe' that obeys simple laws.
As defined in 335 | Andrew Jaffe on Models, Probability, and the Universe
Other definitions
A simple discrete computational system consisting of cells with local rules that determine their state based on neighboring cells; used as a model system to study computational phenomena
CHATGPT won't ever be the same again after this
Where it comes up · 8
- Distributed Consensus with Cellular Automata & Related Systems Research Conference6 claims
- Stephen Wolfram - Where the Computational Paradigm Leads (in Physics, Tech, AI, Biology, Math, ...)4 claims
- 372 | Erik Winfree on DNA Computers and Robots3 claims
- Stephen Wolfram tackles the big questions—from God and free will to whether AI will destroy us all.2 claims
- Stephen Wolfram: Complexity and the Fabric of Reality | Lex Fridman Podcast #2341 claim
- Stephen Wolfram's Take on Artificial Intelligence & The Future of Humanity1 claim
- 335 | Andrew Jaffe on Models, Probability, and the Universe1 claim
- CHATGPT won't ever be the same again after this1 claim
Most important claims · 10 of 19Search all claims for “cellular automaton” →
- Rule 30, a cellular automaton with a simple three-bit rule, produces patterns that appear completely random over many iterations despite starting from a single black cell, demonstrating that simple programs can generate complex and apparently random behavior.Stephen Wolfram - Where the Computational Paradigm Leads (in Physics, Tech, AI, Biology, Math, ...)
- Colored tile sets that bind only when colors match can be designed to simulate Turing machines and cellular automata, following Hao Wang's aperiodic tiling work, so physical molecular tapestries can embody algorithmic self-assembly grounded in mathematical tiling theory.372 | Erik Winfree on DNA Computers and Robots
- Even extremely simple programs with just four to six rules are capable of generating extremely complicated behavior, a phenomenon of the computational universe discovered in the 1980s that contradicts engineering intuition.CHATGPT won't ever be the same again after this
- A simple cellular automaton can generate the sequence of prime numbers through local interactions of bouncing components, demonstrating that apparently sophisticated outputs (prime sequences) can emerge from basic physical processes without requiring consciousness, civilization, or intentional design.Stephen Wolfram's Take on Artificial Intelligence & The Future of Humanity
- The Gax-Kadumov-Levin (GKL) rule, a one-dimensional cellular automaton that operates on a cell and its three neighbors on each side, successfully suppresses finite minorities and achieves consensus regardless of initial configuration, making it a foundational result for understanding distributed consensus in the presence of noiseDistributed Consensus with Cellular Automata & Related Systems Research Conference
- A car is complicated because each part serves one purpose, whereas a complex emergent system has multipurpose parts organized hierarchically that can do many things, and simple-part cellular automata like the Game of Life show that trivial parts can yield enormous complexity.372 | Erik Winfree on DNA Computers and Robots
- Even if we discover a so-called theory of everything we will never know that we are done; we cannot establish that any mathematical or algorithmic description of the world must be correct, partly because one can construct alternative self-consistent worlds (like cellular automata), so nothing about the universe is self-evidently the right answer.335 | Andrew Jaffe on Models, Probability, and the Universe
- The history of cellular automata in distributed systems spans decades from von Neumann's 1950s work on reliable computing from unreliable components through Tomb's 1974 non-ergodic probabilistic cellular automaton to the GKL rule in 1978 and culminates in modern protocols like Avalanche and NKNDistributed Consensus with Cellular Automata & Related Systems Research Conference
- The majority rule cellular automaton on arbitrary graphs is P-complete to predict, meaning that determining whether a specific node will change state by time t is as hard as solving any problem in the complexity class P, but on planar graphs the problem remains P-complete due to the existence of a crossover gadget allowing signal routing without signal intersectionDistributed Consensus with Cellular Automata & Related Systems Research Conference
- Rule 30, a simple cellular automaton with a three-cell neighborhood, generates pseudorandom sequences that are unpredictable despite the rule being completely deterministic, making it useful as a random number generator and potentially for generating randomness in distributed systemsDistributed Consensus with Cellular Automata & Related Systems Research Conference