PSPACE-Completeness of Majority Automata Networks [article]

Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä
2015 arXiv   pre-print
We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state change in some vertex, given an initial configuration, is PSPACE-complete.
arXiv:1501.03992v1 fatcat:rqypr3itkncidaujjyvk6xqjuu