A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update

Página do item simplificado
dc.contributor.authorRuivo E.L.P.
dc.contributor.authorde Oliveira P.P.B.
dc.date.accessioned2024-03-12T23:52:22Z
dc.date.available2024-03-12T23:52:22Z
dc.date.issued2019
dc.description.abstract© 2019Cellular automata are locally-defined, fully discrete dynamical systems. One of the core questions in their study is whether or not they are capable of answering a global question about a configuration, by performing only local computations. Such decision problems include classical ones, such as the density classification task and the parity problem. Traditionally, all cells of a cellular automaton are updated synchronously. However, the possibility of allowing the updates to be asynchronous has raised an increasing interest. In [1], a solution to the parity problem – the determination of the parity of 1s in an arbitrary binary string – was given in terms of a synchronous one-dimensional cellular automaton with 9 neighbours. Here, we present a simpler solution to the same problem, by means of an elementary rule – binary, one-dimensional, with 3 neighbours – that works by asynchronously updating the even and odd positions of the lattice, alternately; we also precisely characterise how many times the rule must be iterated in order for the problem to be solved. Interestingly, our solution relies upon the elementary local parity rule, which apparently represents the first case of a rule able to solve a non-trivial problem both locally and globally.
dc.description.firstpage138
dc.description.lastpage151
dc.description.volume493
dc.identifier.doi10.1016/j.ins.2019.04.045
dc.identifier.issn0020-0255
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/35225
dc.relation.ispartofInformation Sciences
dc.rightsAcesso Restrito
dc.subject.otherlanguageAsynchrony
dc.subject.otherlanguageCellular automata
dc.subject.otherlanguageDeterministic update schedules
dc.subject.otherlanguageEmergent computation
dc.subject.otherlanguageParity problem
dc.titleA perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update
dc.typeArtigo
local.scopus.citations6
local.scopus.eid2-s2.0-85064649660
local.scopus.subjectAsynchronous update
local.scopus.subjectAsynchrony
local.scopus.subjectDensity classification task
local.scopus.subjectElementary cellular automaton
local.scopus.subjectEmergent computation
local.scopus.subjectLocal computation
local.scopus.subjectNon trivial problems
local.scopus.subjectParity problems
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85064649660&origin=inward
Arquivos
Coleções
Artigos de periódico