Merging cellular automata rules to optimise a solution to the modulo-n problem
Tipo
Artigo de evento
Data de publicação
2015
Periódico
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Citações (Scopus)
1
Autores
Martins C.L.M.
De Oliveira P.P.B.
De Oliveira P.P.B.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
© 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.
Descrição
Palavras-chave
Assuntos Scopus
Active state , Emergent computation , MODn problem , Modulo-N , Parity problems