Variations on the Theme of Life

Variations on the Theme of Life is an interactive media piece, an iOS application that generates a unique musical experience using the mathematics of cellular automata and Conway\u27s Game of Life

Cellular automata (Game of Life)

Daná BP se v rešeršní části rozborem a možnostmi tzv. Celulárních automatů (CA). Vysvětluje jejich princip a využití v oblasti simulace. Praktická část realizuje celulární automat typu „Game of life“ v platformě Java.In this bachelor´s thesis was written basic informations about cellular automata, it´s function and usage in simulation. Second part of this work is aimed on celular automata Game of life in Java platform.

Introducing probabilistic celular automata. A versatile extension of Game of Live

The "Game of life" model was created in 1970 by the mathematician Jonh Horton Conway using cellular automata. Since then, di erent extensions of these cellular automata have been used in many applications, such as car traffic control or baggage traffic in an airport. These extensions introduce ideas not only from cellular automata models but also from neural networks theory. In this work, we introduce probabilistic cellular automata which include non-deterministic rules for transitions between successive generations of the automaton together with probabilistic decisions about life and death of the cells in next generation of the automaton. This way, more realistic situations can be modeled and the obtained results are also non-deterministic. As an example of use, an implementation of this probabilistic cellular automaton has been developed using it for simulating tissues evolution. The authors are specially interested in simulations of cancerous tissues.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

The Enlightened Game of Life

We investigate a special class of cellular automata (CA) evolving in a environment filled by an electromagnetic wave. The rules of the Conway's Game of Life are modified to account for the ability to retrieve life-sustenance from the field energy. Light-induced self-structuring and self-healing abilities and various dynamic phases are displayed by the CA. Photo-driven genetic selection and the nonlinear feedback of the CA on the electromagnetic field are included in the model, and there are evidences of self-organized light-localization processes. The evolution of the electromagnetic field is based on the Finite Difference Time Domain (FDTD) approach. Applications are envisaged in evolutionary biology, artificial life, DNA replication, swarming, optical tweezing and field-driven soft-matter.Comment: Revised and enlarged version. Added genetic selection and nonlinear feedback of the CA on the electromagnetic field. 12 pages, 13 figures. To appear in the book Game of Life Cellular Automata (Springer 2010, Andy Adamtzky ed.)

2D Hexagonal Cellular Automata: The Complexity of the Forms

We created two dimensional hexagonal cellular automata to obtain complexity. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction problems, we developed 2-states and 3-states hexagonal growing algorithms that reach large populations through random initial states. Unlike the game of life, we used six neighbourhoods cellular automata instead of eight or four neighbourhoods. First simulations explained that whether we are able to obtain sort of oscillators, blinkers, and gliders. Inspired by Wolfram's 1D cellular automata complexity and life-like structures, we simulated 2D synchronous, discrete, deterministic cellular automata to reach life-like forms with 2-states cells. The life-like formations and the oscillators have been explained how they contribute to initiating self-maintenance together with self-reproduction and self-replication. After comparing the simulation results, we decided to develop the algorithm for another step. Appending a new state to the same algorithm, that we used for reaching life-like structures, led us to experiment new branching and fractal forms. All these studies tried to demonstrate that complex life forms might come from uncomplicated rules

"Жизнь" в тензорах: реализация клеточных автоматов на видеокартах

This paper presents an approach to the description of cellular automata using tensors. This approach allows to attract various frameworks for organizing scientific calculations on high-performance graphics adapter processors, that is, to automatically build parallel software implementations of cellular automata. In our work, we use the TensorFlow framework to organize computations on NVIDIA graphics adapters. As an example cellular automaton we used Conway's Game of Life. The effect of the described approach to the cellular automata implementation is estimated experimentally

Evolving Interesting Initial Conditions for Cellular Automata of the Game of Life Type

The use of a genetic algorithm to obtain "interesting" initial conditions for cellular automata of the family of Conway's Game of Life is described in this paper. The conditions have been selected so as to maximize the number of gliders, R-pentominoes, and similar structures generated during the execution of the automata. Besides the original Game of Life rules, we have tested automata with similar rules, such as HighLife and B38S23, as well as mixed and time-dependent rules. We have concluded that the temporal invariance of the rules of these automata does not seem to be a requirement for the existence of the selected structures