Conceptual connections around density determination in cellular automata

dc.contributor.authorDe Oliveira P.P.B.
dc.date.accessioned2024-03-13T01:03:38Z
dc.date.available2024-03-13T01:03:38Z
dc.date.issued2013
dc.description.abstractA 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.
dc.description.firstpage1
dc.description.lastpage14
dc.description.volume8155 LNCS
dc.identifier.doi10.1007/978-3-642-40867-0_1
dc.identifier.issn0302-9743
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36557
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsAcesso Restrito
dc.subject.otherlanguagecellular automata
dc.subject.otherlanguageDCT
dc.subject.otherlanguageDensity classification task
dc.subject.otherlanguageemergent computation
dc.subject.otherlanguageglobal majority problem
dc.subject.otherlanguagenumber conserving rule
dc.titleConceptual connections around density determination in cellular automata
dc.typeArtigo de evento
local.scopus.citations13
local.scopus.eid2-s2.0-84886429922
local.scopus.subjectDCT
local.scopus.subjectDensity classification task
local.scopus.subjectEmergent computation
local.scopus.subjectMajority problem
local.scopus.subjectnumber conserving rule
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84886429922&origin=inward
Arquivos