Cellular Automata

Modelling and simulation are disciplines of major importance for science and engineering. There is no science without models, and simulation has nowadays become a very useful tool, sometimes unavoidable, for development of both science and engineering. The main attractive feature of cellular automata is that, in spite of their conceptual simplicity which allows an easiness of implementation for computer simulation, as a detailed and complete mathematical analysis in principle, they are able to exhibit a wide variety of amazingly complex behaviour. This feature of cellular automata has attracted the researchers' attention from a wide variety of divergent fields of the exact disciplines of science and engineering, but also of the social sciences, and sometimes beyond. The collective complex behaviour of numerous systems, which emerge from the interaction of a multitude of simple individuals, is being conveniently modelled and simulated with cellular automata for very different purposes. In this book, a number of innovative applications of cellular automata models in the fields of Quantum Computing, Materials Science, Cryptography and Coding, and Robotics and Image Processing are presented

MFCS\u2798 Satellite Workshop on Cellular Automata

For the 1998 conference on Mathematical Foundations of Computer Science (MFCS\u2798) four papers on Cellular Automata were accepted as regular MFCS\u2798 contributions. Furthermore an MFCS\u2798 satellite workshop on Cellular Automata was organized with ten additional talks. The embedding of the workshop into the conference with its participants coming from a broad spectrum of fields of work lead to interesting discussions and a fruitful exchange of ideas. The contributions which had been accepted for MFCS\u2798 itself may be found in the conference proceedings, edited by L. Brim, J. Gruska and J. Zlatuska, Springer LNCS 1450. All other (invited and regular) papers of the workshop are contained in this technical report. (One paper, for which no postscript file of the full paper is available, is only included in the printed version of the report). Contents: F. Blanchard, E. Formenti, P. Kurka: Cellular automata in the Cantor, Besicovitch and Weyl Spaces K. Kobayashi: On Time Optimal Solutions of the Two-Dimensional Firing Squad Synchronization Problem L. Margara: Topological Mixing and Denseness of Periodic Orbits for Linear Cellular Automata over Z_m B. Martin: A Geometrical Hierarchy of Graph via Cellular Automata K. Morita, K. Imai: Number-Conserving Reversible Cellular Automata and Their Computation-Universality C. Nichitiu, E. Remila: Simulations of graph automata K. Svozil: Is the world a machine? H. Umeo: Cellular Algorithms with 1-bit Inter-Cell Communications F. Reischle, Th. Worsch: Simulations between alternating CA, alternating TM and circuit families K. Sutner: Computation Theory of Cellular Automat

Proceedings of JAC 2010. Journées Automates Cellulaires

The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

Programmation et indécidabilités dans les systèmes complexes

N/AUn système complexe est un système constitué d'un ensemble d'entités quiinteragissent localement, engendrant des comportements globaux, émergeant dusystème, qu'on ne sait pas expliquer à partir du comportement local, connu, desentités qui le constituent. Nos travaux ont pour objet de mieux cerner lesliens entre certaines propriétés des systèmes complexes et le calcul. Parcalcul, il faut entendre l'objet d'étude de l'informatique, c'est-à-dire ledéplacement et la combinaison d'informations. À l'aide d'outils issus del'informatique, l'algorithmique et la programmation dans les systèmes complexessont abordées selon trois points de vue. Une première forme de programmation,dite externe, consiste à développer l'algorithmique qui permet de simuler lessystèmes étudiés. Une seconde forme de programmation, dite interne, consiste àdévelopper l'algorithmique propre à ces systèmes, qui permet de construire desreprésentants de ces systèmes qui exhibent des comportements programmés. Enfin,une troisième forme de programmation, de réduction, consiste à plonger despropriétés calculatoires complexes dans les représentants de ces systèmes pourétablir des résultats d'indécidabilité -- indice d'une grande complexitécalculatoire qui participe à l'explication de la complexité émergente. Afin demener à bien cette étude, les systèmes complexes sont modélisés par desautomates cellulaires. Le modèle des automates cellulaires offre une dualitépertinente pour établir des liens entre complexité des propriétés globales etcalcul. En effet, un automate cellulaire peut être décrit à la fois comme unréseau d'automates, offrant un point de vue familier de l'informatique, etcomme un système dynamique discret, une fonction définie sur un espacetopologique, offrant un point de vue familier de l'étude des systèmesdynamiques discrets.Une première partie de nos travaux concerne l'étude de l'objet automatecellulaire proprement dit. L'observation expérimentale des automatescellulaires distingue, dans la littérature, deux formes de dynamiques complexesdominantes. Certains automates cellulaires présentent une dynamique danslaquelle émergent des structures simples, sortes de particules qui évoluentdans un domaine régulier, se rencontrent lors de brèves collisions, avant degénérer d'autres particules. Cette forme de complexité, dans laquelletransparaît une notion de quanta d'information localisée en interaction, estl'objet de nos études. Un premier champ de nos investigations est d'établir uneclassification algébrique, le groupage, qui tend à rendre compte de ce type decomportement. Cette classification met à jour un type d'automate cellulaireparticulier : les automates cellulaires intrinsèquement universels. Un automatecellulaire intrinsèquement universel est capable de simuler le comportement detout automate cellulaire. C'est l'objet de notre second champ d'investigation.Nous caractérisons cette propriété et démontrons son indécidabilité. Enfin, untroisième champ d'investigation concerne l'algorithmique des automatescellulaires à particules et collisions. Étant donné un ensemble de particuleset de collisions d'un tel automate cellulaire, nous étudions l'ensemble desinteractions possibles et proposons des outils pour une meilleure programmationinterne à l'aide de ces collisions.Une seconde partie de nos travaux concerne la programmation par réduction. Afinde démontrer l'indécidabilité de propriétés dynamiques des automatescellulaires, nous étudions d'une part les problèmes de pavage du plan par desjeux de tuiles finis et d'autre part les problèmes de mortalité et depériodicité dans les systèmes dynamiques discrets à fonction partielle. Cetteétude nous amène à considérer des objets qui possèdent la même dualité entredescription combinatoire et topologique que les automates cellulaires. Unenotion d'apériodicité joue un rôle central dans l'indécidabilité des propriétésde ces objets

Proceedings of AUTOMATA 2010: 16th International workshop on cellular automata and discrete complex systems

International audienceThese local proceedings hold the papers of two catgeories: (a) Short, non-reviewed papers (b) Full paper

Automated evolutionary design of self-assembly and self-organising systems

Self-assembly and self-organisation are natural construction processes where the spontaneous formation of aggregates emerges throughout the progressive interplay of local interactions among its constituents. Made upon cooperative self-reliant components, self-assembly and self-organising systems are seen as distributed, not necessarily synchronous, autopoietic mechanisms for the bottom-up fabrication of supra-structures. The systematic understanding of how nature endows these autonomous components with sufficient ''intelligence'' to combine themselves to form useful aggregates brings challenging questions to science, answers to which have many potential applications in matters of life and technological advances. It is for this reason that the investigation to be presented along this thesis focuses on the automated design of self-assembly and self-organising systems by means of artificial evolution. Towards this goal, this dissertation embodies research on evolutionary algorithms applied to the parameters design of a computational model of self-organisation and the components design of a computational model of self-assembly. In addition, an analytical assessment combining correlation metrics and clustering, as well as the exploration of emergent patterns of cooperativity and the measurement of activity across evolution, is made. The results support the research hypothesis that an adaptive process such as artificial evolution is indeed a suitable strategy for the automated design of self-assembly and self-organising systems where local interactions, homogeneity and both stochastic and discrete models of execution play a crucial role in emergent complex structures