Non-trivial automata networks do exist that solve the global majority problem with the local majority rule

Read full text Summarise with VIRAT
Authors: P. Balbi, Kévin Perrot, Marius Rolland, Eurico Ruivo
Cited by: 0
References: 11

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The global majority problem, often referred to as the Density Classification Task, is a classical benchmark in the context of probing the computational capabilities of automata networks. It poses the simple yet challenging problem of determining, by totally local means, whether an arbitrary initial configuration of binary states can evolve to a final, homogeneous global configuration that reflects the initial global majority. Although it is known that in the specific case of cellular automata with periodic boundaries no rule is able to solve the problem, in other formulations solutions are known and, in others, the problem is still open. Aligned with the latter, here we explore the possibility of solving the problem with automata networks, operating only with the local majority rule, with a focus on identifying non-trivial cases where it can be solved and explaining why they do so.

Fields of Study & Subjects

Cellular Automata and Applications semigroups and automata theory DNA and Biological Computing

Publication details

Journal / source
arXiv (Cornell University)
Publication date
19 March 2026
Language
EN
Document type
Preprint