Browsing by Author "201-0159927"
Now showing items 1-11 of 11
-
Goles Chacc, Eric,; Meunier, P.-E.; Rapaport Zimermann, Iván; Theyssier, G. (Elsevier, 2011)The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most cases. In this article, ...
-
Goles Chacc, Eric, 1951-; Salinas, L. (ELSEVIER, 2008-05-10)In this article we study some aspects about the graph associated with parallel and serial behavior of a Boolean network. We conclude that the structure of the associated graph can give some information about the attractors ...
-
Salinas, L.; Goles Chacc, Eric (ELSEVIER SCIENCE BV, 2008-05-10)In this paper we introduce the “do not touch” condition for squares in the discrete plane. We say that two squares “do not touch” if they do not share any vertex or any segment of an edge. Using this condition we define ...
-
Gajardo, A.; Goles Chacc, Eric, 1951- (ELSEVIER, 2006-12-15)We prove that in a two-dimensional Sandpile automaton, embedded in a regular infinite planar cellular space, it is impossible to cross information, if the bit of information is the presence (or absence) of an avalanche. ...
-
Salinas Ayala, Lilian Angélica (Universidad de ChilePrograma Cybertesis, 2008)En esta tesis hemos estudiado dos problemas: el primero consiste en encontrar condiciones mínimas para obtener una cierta clase de recubrimientos del plano discreto mediante cuadrados y el segundo corresponde al estudio ...
-
Plana Perillán, Francisco Antonio (2014)Una red Booleana es un modelo de redes en el cual, cada nodo o elemento de la red tiene asociado una función Booleana que determina el estado del nodo respectivo, y de esta forma la evolución de la red en el tiempo. Los ...
-
Goles Chacc, Eric; Montealegre, Pedro; Ríos Wilson, Martín (American Institute of Mathematical Sciences AIMS, 2020)A boolean network is a map F : {0, 1}(n) -> {0, 1}(n) that defines a discrete dynamical system by the subsequent iterations of F. Nevertheless, it is thought that this definition is not always reliable in the context of ...
-
Goles Chacc, Eric, 1951-; Montealegre, Pedro; Salo, Ville; Törmä, Ilkka (Elsevier, 2016)We study the dynamics of majority automata networks when the vertices are updated according to a block sequential updating scheme. In particular, we show that the complexity of the problem of predicting an eventual state ...
-
Guíñez Abarzúa, Flavio Ricardo (Universidad de ChilePrograma Cybertesis, 2009)Esta tesis trata sobre un problema de reconstrucción en Tomografía Discreta en el cual se está interesado en colorear una grilla usando k colores, de tal forma que para cada fila y columna, el número de celdas de cada color ...
-
Montealegre Barba, Pedro Tómas (Universidad de Chile, 2012)El presente trabajo consiste en el estudio de la complejidad computacional en algunas redes de autómatas. En particular en el problema de decisión, que llamamos PER, el cual consiste en predecir cambios de estado en un ...
-
Markus, Mario; Schmick, Malte; Goles Chacc, Eric (JOHN WILEY, 2006-02)The well-known "ant" defined by C Langton on a grid with black and white squares is forced by periodical binary sequences {r(m)}, as follows: i) The ant turns 90 degrees to the left (right) if it enters a white (black) ...