Now showing items 21-26 of 26
Obtenção e utilização de grafos-limite de autômatos celulares elementares
(Universidade Presbiteriana Mackenzie, 2016-09-28)
Cellular automata are locally de ned dynamical systems which are discrete in space, time and in the state variables, and capable of presenting arbitrarily complex global emergent behaviour. One core question in the study ...
Explorando a noção de reversibilidade parcial de autômatos celulares elementares em reticulados cíclicos
(Universidade Presbiteriana Mackenzie, 2010-08-12)
Cellular automata have been studied as computer models in many different forms. Several of its properties have been widely explored, among which reversibility stands out. This property is able to provide a cellular automaton ...
Diferença entre templates de autômatos celulares unidimensionais binários
(Universidade Presbiteriana Mackenzie, 2016-08-16)
Templates are formal representations for sets of one-dimensional cellular automata created by means of a generalisation of the classical state transition tables. Algorithms already do exist in the literature that ...
Busca evolutiva por redes booleanas na tarefa de classificação de densidade
(Universidade Presbiteriana Mackenzie, 2018-05-02)
Boolean networks consist of nodes that represent binary variables, which are computed as a function of the values represented by their adjacent nodes. This local processing entails global behaviors, such as the convergence ...
Exploração computacional dos espectros de Fourier de autômatos celulares elementares assíncronos
(Universidade Presbiteriana Mackenzie, 2019-07-31)
The spectral analysis and asynchronous cellular automata subjects are relevant among the cellular automata scientific community. Asynchronous cellular automata are variants of cellular automata at which the cells have their ...
Projeto evolutivo de circuitos combinacionais quânticos
(Universidade Presbiteriana Mackenzie, 2020-02-04)
While advances in quantum hardware occur in modest steps, simulators running on classical computers allow a slightly faster advance in the construction of quantum algorithms. Given a unitary matrix that performs a given ...