On the complexity of two-dimensional signed majority cellular automata - Archive ouverte HAL Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2018

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.
Fichier principal
Vignette du fichier
GMPT-thresholdDyn-JCSS.pdf (9.02 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01472161 , version 1 (20-02-2017)
hal-01472161 , version 2 (09-01-2019)

Licence

Identifiers

  • HAL Id : hal-01472161 , version 2

Cite

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, 2018, 91, pp.1-32. ⟨hal-01472161v2⟩
1090 View
237 Download

Share

Gmail Mastodon Facebook X LinkedIn More