Asynchronous cellular automata with random majority updates do not achieve the same level of reliable consensus as synchronous versions, but can be improved by adding state to track the local time modulo 3 for each node so neighbors know whether they should wait for updates from each other, though this introduces new challenges with deadlocks in 2D and long waiting chains that degrade error correction
factualpending
Speaker
Stephen WolframEvidence Quote
“asynchronous updating destroys kind of the the nice consensus properties of these particular rules i did a bit of a search for rules that would even with a asynchronous updating would successfully preserve consensus this is the the best out of about two million what was it uh yeah a million range two rules the results are pretty crummy”
Created: 8/10/2026, 11:10:13 PM
My Notes
Loading notes...