Conceptual connections around density determination in cellular automata

Tipo
Artigo de evento
Data de publicação
2013
Periódico
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Citações (Scopus)
13
Autores
De Oliveira P.P.B.
Orientador
Título da Revista
ISSN da Revista
Título de Volume
Membros da banca
Programa
Resumo
A recurring and well studied benchmark problem in the context of computations with cellular automata is the attempt to determine which is the most frequent cell state in an arbitrary initial configuration. Although extremely simple in formulation, the problem has unveiled a rich web of conceptual connections which, at the same time, have enlarged and challenged our understanding about how to perform computations within cellular automata. Here, we outline such a conceptual web, and provide a personal assessment of some of its loose ends, with possibly fruitful paths to address them. © 2013 Springer-Verlag.
Descrição
Palavras-chave
Assuntos Scopus
DCT , Density classification task , Emergent computation , Majority problem , number conserving rule
Citação
DOI (Texto completo)
10.1007/978-3-642-40867-0_1
URI
https://dspace.mackenzie.br/handle/10899/36557
Coleções
Artigo de evento