Related papers: Problife: a Probabilistic Game of Life

A cellular automaton is presented whose governing rule is that the Kolmogorov complexity of a cell's neighborhood may not increase when the cell's present value is substituted for its future value. Using an approximation of this…

We present a new extension of Conway's game of life for two players, which we call p2life. P2life allows one of two types of token, black or white, to inhabit a cell, and adds competitive elements into the birth and survival rules of the…

We present a game of interacting agents which mimics the complex dynamics found in many natural and social systems. These agents modify their strategies periodically, depending on their performances using genetic crossover mechanisms,…

We enable aProbLog---a probabilistic logical programming approach---to reason in presence of uncertain probabilities represented as Beta-distributed random variables. We achieve the same performance of state-of-the-art algorithms for highly…

Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…

To test generalization ability of a class of deep neural networks, we randomly generate a large number of different rule sets for 2-D cellular automata (CA), based on John Conway's Game of Life. Using these rules, we compute several…

We introduce DeepProbLog, a neural probabilistic logic programming language that incorporates deep learning by means of neural predicates. We show how existing inference and learning techniques of the underlying probabilistic logic…

Metaheuristic and self-organizing criticality (SOC) could contribute to robust computation under perturbed environments. Implementing a logic gate in a computing system in a critical state is one of the intriguing ways to study the role of…

Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…

We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced…

Recently we introduced a model of symbiosis, Model-S, based on the evolution of seed patterns in Conway's Game of Life. In the model, the fitness of a seed pattern is measured by one-on-one competitions in the Immigration Game, a two-player…

Conway's cellular automaton Game of LIFE has been conjectured to be a critical (or quasicritical) dynamical system. This criticality is generally seen as a continuous order-disorder transition in cellular automata (CA) rule space. LIFE's…

We present a formulation of the problem of probabilistic model checking as one of query evaluation over probabilistic logic programs. To the best of our knowledge, our formulation is the first of its kind, and it covers a rich class of…

Living organisms survive and multiply even though they have uncertain and incomplete information about their environment and imperfect models to predict the consequences of their actions. Bayesian models have been proposed to face this…

Computational power can be measured by assigning an algebraic structure to a computational device. Here, we convert a small patch of Conway's Game of Life into a transformation semigroup. The conversion captures not only time evolution but…

Players are arranged on a regular lattice and coded with a specific strategy for a pre-defined game. Each player sums their payoffs from playing the game with each of their neighbors, and then adopts the strategy of the most successful…

Probabilistic logic programs are logic programs where some facts hold with a specified probability. Here, we investigate these programs with a causal framework that allows counterfactual queries. Learning the program structure from…

Cellular automata can simulate many complex physical phenomena using the power of simple rules. The presented methodological platform expresses the concept of programmable matter in which Newtons laws of motion are one of examples. Energy…

We investigate the dynamics of a conservative version of Conway's Game of Life, in which a pair consisting of a dead and a living cell can switch their states following Conway's rules but only by swapping their positions, irrespective of…

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…