Computing Modulo-n by Composing Cellular Automata Rules
dc.contributor.author | Martins C.L.M. | |
dc.contributor.author | De Oliveira P.P.B. | |
dc.date.accessioned | 2024-03-13T00:53:16Z | |
dc.date.available | 2024-03-13T00:53:16Z | |
dc.date.issued | 2016 | |
dc.description.abstract | © 2016 IOS Press and the authors.The understanding of how predefined computations can be attained by means of individual cellular automata rules, their spatial arrangements or their temporal sequences, is a key conceptual underpinning in the general notion of emergent computation. In this context, here we construct a solution to the MODn problem, which is the determination of whether the number of 1-bits in a cyclic binary string is perfectly divisible by the integer n > 1. Our solution is given for any lattice size N that is co-prime to n, and relies upon a set of one-dimensional rules, with maximum radius of n-1, organised in a temporal sequence. Although the simpler cases of the problem for n = 2 and n = 3 have been addressed in the literature, this is the first account on the general case, for arbitrary n. | |
dc.description.firstpage | 1 | |
dc.description.issuenumber | 1 | |
dc.description.lastpage | 17 | |
dc.description.volume | 145 | |
dc.identifier.doi | 10.3233/FI-2016-1344 | |
dc.identifier.issn | 0169-2968 | |
dc.identifier.uri | https://dspace.mackenzie.br/handle/10899/35976 | |
dc.relation.ispartof | Fundamenta Informaticae | |
dc.rights | Acesso Restrito | |
dc.subject.otherlanguage | active state transitions | |
dc.subject.otherlanguage | Cellular automata | |
dc.subject.otherlanguage | classification | |
dc.subject.otherlanguage | decision problem | |
dc.subject.otherlanguage | emergent computation | |
dc.subject.otherlanguage | MODn | |
dc.subject.otherlanguage | modulo-n problem | |
dc.subject.otherlanguage | parity | |
dc.subject.otherlanguage | rule composition | |
dc.title | Computing Modulo-n by Composing Cellular Automata Rules | |
dc.type | Artigo | |
local.scopus.citations | 1 | |
local.scopus.eid | 2-s2.0-84971394490 | |
local.scopus.subject | Active state | |
local.scopus.subject | Decision problems | |
local.scopus.subject | Emergent computation | |
local.scopus.subject | MODn | |
local.scopus.subject | Modulo-N | |
local.scopus.subject | parity | |
local.scopus.updated | 2024-05-01 | |
local.scopus.url | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84971394490&origin=inward |