A fully operational framework for handling cellular automata templates

dc.contributor.authorVerardo M.
dc.contributor.authorDe Oliveira P.P.B.
dc.date.accessioned2024-03-12T23:55:24Z
dc.date.available2024-03-12T23:55:24Z
dc.date.issued2019
dc.description.abstract© 2019 Mauricio Verardo and Pedro P. B. de Oliveira.Cellular automata are fully discrete, computational, or dynamical systems, characterised by a local, totally decentralised action. Although extremely simple in structure, they are able to represent arbitrarily complex phenomena. However, due to the very big number of rules in any nontrivial space, finding a local rule that globally unfolds as desired remains a challenging task. In order to help along this direction, here we present the current state of cellular automata templates, a data structure that allows for the representation of sets of cellular automata in a compact manner. The template data structure is defined, along with processes by which interesting templates can be built. In the end, we give an illustrative example showcasing how templates can be used to explore a very large cellular automaton space. Although the idea itself of template has been introduced before, only now its conceptual underpinnings and computational robustness rendered the notion effective for practical use.
dc.description.volume2019
dc.identifier.doi10.1155/2019/6573793
dc.identifier.issn1099-0526
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/35390
dc.relation.ispartofComplexity
dc.rightsAcesso Aberto
dc.titleA fully operational framework for handling cellular automata templates
dc.typeArtigo
local.scopus.citations1
local.scopus.eid2-s2.0-85065777592
local.scopus.subjectComputational robustness
local.scopus.subjectDecentralised
local.scopus.subjectFully discrete
local.scopus.subjectFully operational
local.scopus.subjectLocal rules
local.scopus.subjectPractical use
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85065777592&origin=inward
Arquivos