GKL rule
A specific cellular automaton rule developed by Gacs, Kadumov, and Levin that can achieve density classification and suppress finite minorities of cells even in the presence of random noise
As defined in Distributed Consensus with Cellular Automata & Related Systems Research Conference
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “GKL rule” →
- 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
- Fireflies and other biological systems achieve synchronization through mechanisms similar to cellular automata, where local interactions lead to global coordination without central controlDistributed Consensus with Cellular Automata & Related Systems Research Conference