Merging cellular automata rules to optimise a solution to the modulo-n problem

Página do item simplificado
dc.contributor.authorMartins C.L.M.
dc.contributor.authorDe Oliveira P.P.B.
dc.date.accessioned2024-03-13T00:59:14Z
dc.date.available2024-03-13T00:59:14Z
dc.date.issued2015
dc.description.abstract© IFIP International Federation for Information Processing 2015.Understanding how the composition of cellular automata rules can perform predefined computations can contribute to the general notion of emerging computing by means of locally processing components. In this context, a solution has been recently proposed to the Modulo-n Problem, which is the determination of whether the number of 1-bits in a binary string is perfectly divisible by the positive integer n. Here, we show how to optimise that solution in terms of a reduction of the number of rules required, by means of a merging operation involving of the rules´ active state transitions. The potential for a more general usage of the merging operation is also addressed.
dc.description.firstpage196
dc.description.lastpage209
dc.description.volume9099
dc.identifier.doi10.1007/978-3-662-47221-7_15
dc.identifier.issn1611-3349
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36313
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsAcesso Aberto
dc.subject.otherlanguageActive state transitions
dc.subject.otherlanguageCellular automata
dc.subject.otherlanguageEmergent computation
dc.subject.otherlanguageMerging
dc.subject.otherlanguageMODn problem
dc.subject.otherlanguageModulo-n problem
dc.subject.otherlanguageParity problem
dc.subject.otherlanguageRule composition
dc.titleMerging cellular automata rules to optimise a solution to the modulo-n problem
dc.typeArtigo de evento
local.scopus.citations1
local.scopus.eid2-s2.0-84937439237
local.scopus.subjectActive state
local.scopus.subjectEmergent computation
local.scopus.subjectMODn problem
local.scopus.subjectModulo-N
local.scopus.subjectParity problems
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84937439237&origin=inward
Arquivos
Coleções
Artigo de evento