Evolving sequential combinations of elementary cellular automata rules
Tipo
Artigo de evento
Data de publicação
2005
Periódico
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Citações (Scopus)
16
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
Performing computations with cellular automata, individually or arranged in space or time, opens up new conceptual issues in emergent, artificial life type forms of computation, and opens up the possibility of novel technological advances. Here, a methodology for combining sequences of elementary cellular automata is presented, in order to perform a given computation. The problem at study is the well-known density classification task that consists of determining the most frequent bit in a binary string. The methodology relies on an evolutionary algorithm, together with analyses driven by background knowledge on dynamical behaviour of the rules and their parametric estimates, as well as those associated with the formal behaviour characterisation of the rules involved. The resulting methodology builds upon a previous approach available in the literature, and shows its efficacy by leading to 2 rule combinations already known, and to additional 26, apparently unknown so far. © Springer-Verlag Berlin Heidelberg 2005.
Descrição
Palavras-chave
Assuntos Scopus
Artificial life type forms , Elementary cellular automata rules , Sequential combinations , Technological advances