Computational evidence against the possibility of density determination with fixed arrangements of non-local elementary rules

Página do item simplificado
dc.contributor.authorDe Oliveira P.P.B.
dc.contributor.authorFaria F.
dc.contributor.authorZanon R.
dc.contributor.authorLeite R.M.
dc.date.accessioned2024-03-13T00:58:44Z
dc.date.available2024-03-13T00:58:44Z
dc.date.issued2015
dc.description.abstract© 2015 Old City Publishing, Inc.Cellular automata with alternative definitions to the standard enable different ways of processing global computational tasks based on local actions. Here, we evaluate the existence of non-uniform arrangements of elementary cellular automata, fixed in their corresponding cells, in the resolution of the classical density classification problem, namely, the determination of the predominant bit in a cyclic binary string. Variations in the pattern of neighbourhood connections are studied in different rule arrangements by means of non-local connections, and solutions are sought exhaustively for lattice size N = 5, enumeratively for N = 7, and with evolutionary searches for N ∈ {7, 9, 11}. We rely on non-local neighbourhoods as a way to extend the rule space beyond the elementary. Perfect solutions were found only for N = 5, but no generalisation was possible for N = 7. Overall, all maximally performing rule arrangements found turn out to require at least one rule with global ou nearly global action. The joint outcome of the computational experiments contributes to the general, still open question of whether it is possible to solve density classification with fixed, non-uniform rule arrangements, by suggestting a negative possibility.
dc.description.firstpage325
dc.description.issuenumber3-4
dc.description.lastpage343
dc.description.volume11
dc.identifier.issn1548-7202
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/36285
dc.relation.ispartofInternational Journal of Unconventional Computing
dc.rightsAcesso Restrito
dc.subject.otherlanguageDCT
dc.subject.otherlanguageDensity classification task
dc.subject.otherlanguageElementary cellular automata
dc.subject.otherlanguageEmergent computation
dc.subject.otherlanguageEvolutionary search
dc.subject.otherlanguageGenetic algorithm
dc.subject.otherlanguageHybrid
dc.subject.otherlanguageNon-local
dc.subject.otherlanguageNon-uniform
dc.titleComputational evidence against the possibility of density determination with fixed arrangements of non-local elementary rules
dc.typeArtigo
local.scopus.citations1
local.scopus.eid2-s2.0-84951808904
local.scopus.subjectDCT
local.scopus.subjectDensity classification task
local.scopus.subjectElementary cellular automaton
local.scopus.subjectEmergent computation
local.scopus.subjectEvolutionary search
local.scopus.subjectHybrid
local.scopus.subjectNon-uniform
local.scopus.subjectNonlocal
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84951808904&origin=inward
Arquivos
Coleções
Artigos de periódico