Skip to Main content Skip to Navigation
Journal articles

On the complexity of two-dimensional signed majority cellular automata

Abstract : We study the complexity of signed majority cellular automata on the planar grid. We show that, depending on their symmetry and uniformity, they can simulate different types of logical circuitry under different modes. We use this to establish new bounds on their overall complexity, concretely: the uniform asymmetric and the non-uniform symmetric rules are Turing universal and have a P-complete prediction problem; the non-uniform asymmetric rule is in-trinsically universal; no symmetric rule can be intrinsically universal. We also show that the uniform asymmetric rules exhibit cycles of super-polynomial length, whereas symmetric ones are known to have bounded cycle length.
Complete list of metadata

Cited literature [37 references]  Display  Hide  Download
Contributor : Guillaume Theyssier <>
Submitted on : Wednesday, January 9, 2019 - 1:46:08 PM
Last modification on : Monday, May 11, 2020 - 4:20:51 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial - ShareAlike 4.0 International License


  • HAL Id : hal-01472161, version 2


Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier. On the complexity of two-dimensional signed majority cellular automata. Journal of Computer and System Sciences, Elsevier, 2018, 91, pp.1-32. ⟨hal-01472161v2⟩



Record views


Files downloads