On the parity problem in one-dimensional cellular automata

dc.contributor.authorBetel H.
dc.contributor.authorDe Oliveira P.P.B.
dc.contributor.authorFlocchini P.
dc.date.accessioned2024-03-13T01:07:33Z
dc.date.available2024-03-13T01:07:33Z
dc.date.issued2012
dc.description.abstract© 2012 Open Publishing Association. All Rights Reserved.We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to see that the problem is ill-defined for even-sized lattices (which, by definition, would never be able to converge to 1). We then consider only odd lattices. We are interested in determining the minimal neighbourhood that allows the problem to be solvable for any initial configuration. On the one hand, we show that radius 2 is not sufficient, proving that there exists no radius 2 rule that can possibly solve the parity problem from arbitrary initial configurations. On the other hand, we design a radius 4 rule that converges correctly for any initial configuration and we formally prove its correctness. Whether or not there exists a radius 3 rule that solves the parity problem remains an open problem.
dc.description.firstpage110
dc.description.lastpage126
dc.description.volume90
dc.identifier.doi10.4204/EPTCS.90.9
dc.identifier.issn2075-2180
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36779
dc.relation.ispartofElectronic Proceedings in Theoretical Computer Science, EPTCS
dc.rightsAcesso Aberto
dc.titleOn the parity problem in one-dimensional cellular automata
dc.typeArtigo de evento
local.scopus.citations2
local.scopus.eid2-s2.0-84910609874
local.scopus.subjectInitial configuration
local.scopus.subjectNeighbourhood
local.scopus.subjectParity problems
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84910609874&origin=inward
Arquivos