scholarly journals The structure of communication problems in cellular automata

2011 ◽  
Vol DMTCS Proceedings vol. AP,... (Proceedings) ◽  
Author(s):  
Raimundo Briceño ◽  
Pierre-Etienne Meunier
Keyword(s):  
Cellular Automata ◽  
Communication Complexity ◽  
Intrinsic Universality ◽  
The Past ◽  
Communication Problems ◽  
International Audience ◽  
Simulation Relations

International audience Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown. One of the last extensions of this theory was its generalization to various "communication problems'', or "questions'' one might ask about the dynamics of cellular automata. In this article, we aim at structuring these problems, and find what makes them interesting for the study of intrinsic universality and quasi-orders induced by simulation relations.

scholarly journals Communication complexity and intrinsic universality in cellular automata

2011 ◽  
Vol 412 (1-2) ◽  
pp. 2-21 ◽  
Author(s):  
E. Goles ◽  
P.-E. Meunier ◽  
I. Rapaport ◽  
G. Theyssier
Keyword(s):  
Cellular Automata ◽  
Communication Complexity ◽  
Intrinsic Universality

scholarly journals Traced communication complexity of cellular automata

2011 ◽  
Vol 412 (30) ◽  
pp. 3906-3916 ◽  
Author(s):  
Eric Goles ◽  
Pierre Guillon ◽  
Ivan Rapaport
Keyword(s):  
Cellular Automata ◽  
Communication Complexity

scholarly journals Communication complexity in number-conserving and monotone cellular automata

2011 ◽  
Vol 412 (29) ◽  
pp. 3616-3628 ◽  
Author(s):  
E. Goles ◽  
A. Moreira ◽  
I. Rapaport
Keyword(s):  
Cellular Automata ◽  
Communication Complexity

scholarly journals The fractal structure of cellular automata on abelian groups

2010 ◽  
Vol DMTCS Proceedings vol. AL,... (Proceedings) ◽  
Author(s):  
Johannes Gütschow ◽  
Vincent Nesme ◽  
Reinhard F. Werner
Keyword(s):  
Cellular Automata ◽  
Fractal Structure ◽  
Cell Structure ◽  
Ring Structure ◽  
Entangled States ◽  
Universal Model ◽  
Basic Building Block ◽  
Quantum Cellular Automata ◽  
Sierpinski Triangle ◽  
International Audience

International audience It is a well-known fact that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo $2$ generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular automata is a much explored topic, but virtually all of the results revolve around a special class of automata, whose main features include irreversibility, an alphabet with a ring structure and a rule respecting this structure, and a property known as being (weakly) $p$-Fermat. The class of automata that we study in this article fulfills none of these properties. Their cell structure is weaker and they are far from being $p$-Fermat, even weakly. However, they do produce fractal spacetime diagrams, and we will explain why and how. These automata emerge naturally from the field of quantum cellular automata, as they include the classical equivalent of the Clifford quantum cellular automata, which have been studied by the quantum community for several reasons. They are a basic building block of a universal model of quantum computation, and they can be used to generate highly entangled states, which are a primary resource for measurement-based models of quantum computing.

scholarly journals Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Thomas P. Hayes
Keyword(s):  
Positive Integer ◽  
Open Problem ◽  
Communication Complexity ◽  
60Th Birthday ◽  
Equal Size ◽  
Special Issue ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Zarankiewicz Problem ◽  
Complexity Hierarchy

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience For every positive integer k, we construct an explicit family of functions f : \0, 1\(n) -\textgreater \0, 1\ which has (k + 1) - party communication complexity O(k) under every partition of the input bits into k + 1 parts of equal size, and k-party communication complexity Omega (n/k(4)2(k)) under every partition of the input bits into k parts. This improves an earlier hierarchy theorem due to V. Grolmusz. Our construction relies on known explicit constructions for a famous open problem of K. Zarankiewicz, namely, to find the maximum number of edges in a graph on n vertices that does not contain K-s,K-t as a subgraph.

scholarly journals Number conserving cellular automata: new results on decidability and dynamics

2003 ◽  
Vol DMTCS Proceedings vol. AB,... (Proceedings) ◽  
Author(s):  
Bruno Durand ◽  
Enrico Formenti ◽  
Aristide Grange ◽  
Zsuzsanna Róka
Keyword(s):  
Cellular Automata ◽  
Linear Time ◽  
Number Conservation ◽  
International Audience

International audience This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.

scholarly journals The Bibliometric Analysis of Czech Geography in the Scopus Database

Geografie ◽  
2012 ◽  
Vol 117 (1) ◽  
pp. 52-71 ◽  
Author(s):  
Artur Bajerski ◽  
Tadeusz Siwek
Keyword(s):  
Bibliometric Analysis ◽  
Restricted Range ◽  
Geographical Research ◽  
Geographical Society ◽  
The Past ◽  
Exchange Of Information ◽  
International Audience ◽  
Regional Basis ◽  
Scopus Database

The analysis focuses on two journals: Geografie (published by the Czech Geographical Society in Czech and English) and Moravian Geographical Reports (only in English). The analysis demonstrates that the scope of both journals is only regional, due to their relatively restricted range of authors and citations: the first periodical functions mainly within Bohemia, with some overlap into other Czech regions, while the second is active primarily in Moravia, overlapping somewhat into Slovakia and Poland. Despite their status as premier Czech geographical periodicals, both journals serve mainly as conduits for the exchange of information among academics on a regional basis. Important papers presenting the results of Czech geographical research to a wide international audience are rarely featured in these journals; such research is usually published as monographs, as has been the case in the past. This paper lists the most frequently cited Czech geographers and interdisciplinary citations – especially in and from sociology and economics papers.

scholarly journals On the analysis of ''simple'' 2D stochastic cellular automata

2010 ◽  
Vol Vol. 12 no. 2 ◽  
Author(s):  
Damien Regnault ◽  
Nicolas Schabanel ◽  
Eric Thierry
Keyword(s):  
Cellular Automata ◽  
Time Step ◽  
Energy Functions ◽  
Stochastic Cellular Automata ◽  
Von Neumann ◽  
Rich Variety ◽  
Moore Neighborhood ◽  
International Audience ◽  
Definition Of ◽  
New Phenomena

International audience Cellular automata are usually associated with synchronous deterministic dynamics, and their asynchronous or stochastic versions have been far less studied although significant for modeling purposes. This paper analyzes the dynamics of a two-dimensional cellular automaton, 2D Minority, for the Moore neighborhood (eight closest neighbors of each cell) under fully asynchronous dynamics (where one single random cell updates at each time step). 2D Minority may appear as a simple rule, but It is known from the experience of Ising models and Hopfield nets that 2D models with negative feedback are hard to study. This automaton actually presents a rich variety of behaviors, even more complex that what has been observed and analyzed in a previous work on 2D Minority for the von Neumann neighborhood (four neighbors to each cell) (2007) This paper confirms the relevance of the later approach (definition of energy functions and identification of competing regions) Switching to the Moot e neighborhood however strongly complicates the description of intermediate configurations. New phenomena appear (particles, wider range of stable configurations) Nevertheless our methods allow to analyze different stages of the dynamics It suggests that predicting the behavior of this automaton although difficult is possible, opening the way to the analysis of the whole class of totalistic automata

Sign in / Sign up

Export Citation Format

Share Document