Abstract
The initial majority identification task is a fundamental test problem in cellular automaton research. To pass the test, a two-state automaton has to attain a uniform configuration consisting of only the state that was initially in the majority. It does so solely through its local, internal dynamics—i.e., success in the task is an example of emergent computation. Finding new, better-performing automata continues to be of interest for what additional clues they might reveal about this form of computation. Here we describe a novel, coarsened version of one of the standard majority identifiers. We show that this coarsened system outperforms its parent automaton while significantly reducing the number of computations required to accomplish the task.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
