Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem

Página do item simplificado
dc.contributor.authorMartins C.L.M.
dc.contributor.authorde Oliveira P.P.B.
dc.date.accessioned2024-03-13T01:34:15Z
dc.date.available2024-03-13T01:34:15Z
dc.date.issued2009
dc.description.abstractThe understanding of how simple predefined computations can be achieved with cellular automata, either through individual rules, or with rules organised in spatial arrangements or in temporal sequences is a key conceptual underpinning in the general notion of emergent computation. In this context, the parity problem for cellular automata is considered here, through which the number of 1-bits in a binary string should be determined to be even or odd. Although it is known that no individual rule can solve this problem, a solution has been presented in the literature that is able to solve it, for any string length, by means of the sequential chaining of elementary cellular automata rules. Drawing on that solution, here we provide others, significantly simplified from the latter, our approach being based upon analyses of the behaviour of the rules used in the original work. © 2009 Elsevier B.V. All rights reserved.
dc.description.firstpage103
dc.description.lastpage119
dc.description.volume252
dc.identifier.doi10.1016/j.entcs.2009.09.017
dc.identifier.issn1571-0661
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/37336
dc.relation.ispartofElectronic Notes in Theoretical Computer Science
dc.rightsAcesso Aberto
dc.subject.otherlanguageElementary cellular automata
dc.subject.otherlanguageemergent computation
dc.subject.otherlanguageparity problem
dc.subject.otherlanguagerule-changing cellular automata
dc.subject.otherlanguagesequential co bination of rules
dc.subject.otherlanguagetemporal combination of rules
dc.titleImprovement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem
dc.typeArtigo
local.scopus.citations9
local.scopus.eid2-s2.0-70349408584
local.scopus.subjectElementary cellular automata
local.scopus.subjectemergent computation
local.scopus.subjectparity problem
local.scopus.subjectrule-changing cellular automata
local.scopus.subjectsequential co bination of rules
local.scopus.subjecttemporal combination of rules
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=70349408584&origin=inward
Arquivos
Coleções
Artigos de periódico