Ergodicity is a key property distinguishing non-ergodic infinite cellular automata that can maintain long-term order from ergodic ones that will eventually visit all possible states, and the distinction is crucial for understanding whether a cellular automaton can preserve information against noise

definitionpending

Speaker

Peter Gacs

Evidence Quote

“if you take a probability sir probably 600 automaton and we say it's essentially if it forgets everything about its initial configuration and more precisely what this means is that that there is some fixed measure in you such that that on any finite set of cells if you look at the probability of this finite set of cells being in a particular array of states then this probability will converge to the corresponding probability new probability of this independently of what the initial configuration works right so it really forgets everything about the initial configuration”

Source

Distributed Consensus with Cellular Automata & Related Systems Research Conference— Wolfram
Created: 8/10/2026, 11:10:13 PM

Your notes

Loading notes...