English
Related papers

Related papers: Problife: a Probabilistic Game of Life

200 papers

Complex networks serve as abstract models for understanding real-world complex systems and provide frameworks for studying structured dynamical systems. This article addresses limitations in current studies on the exploration of individual…

Social and Information Networks · Computer Science 2025-10-14 Bin Pi , Liang-Jian Deng , Minyu Feng , Matjaž Perc , Jürgen Kurths

Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This paper presents a practical, yet…

Logic in Computer Science · Computer Science 2024-06-03 Blair Archibald , Muffy Calder , Michele Sevegnani

We investigate Conway's Game of Life played on the Robinson triangle Penrose tiling. In this paper, we classify all four-cell still lifes.

Cellular Automata and Lattice Gases · Physics 2023-04-11 Seung Hyeon Mandy Hong , May Mei

In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this paper, we give a natural definition of strong bisimulation for…

Logic in Computer Science · Computer Science 2014-05-12 Holger Hermanns , Jan Krčál , Jan Křetínský

Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…

Quantum Physics · Physics 2008-11-04 Ioannis G. Karafyllidis

This paper investigates the effect of learning a forward model on the performance of a statistical forward planning agent. We transform Conway's Game of Life simulation into a single-player game where the objective can be either to preserve…

Stochastic processes govern the time evolution of a huge variety of realistic systems throughout the sciences. A minimal description of noisy many-particle systems within a Markovian picture and with a notion of spatial dimension is given…

Statistical Mechanics · Physics 2021-02-25 Andrea Pizzi , Andreas Nunnenkamp , Johannes Knolle

Let A:={0,1}. A `cellular automaton' (CA) is a shift-commuting transformation of A^{Z^D} determined by a local rule. Likewise, a `Euclidean automaton' is a shift-commuting transformation of A^{R^D} determined by a local rule. `Larger than…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements…

Machine Learning · Computer Science 2025-05-22 Gabriel Béna , Maxence Faldor , Dan F. M. Goodman , Antoine Cully

The emergence of tools based on artificial intelligence has also led to the need of producing explanations which are understandable by a human being. In most approaches, the system is considered a black box, making it difficult to generate…

Artificial Intelligence · Computer Science 2024-10-23 Germán Vidal

The Prisoner's Dilemma (PD) game is used in several fields due to the emergence of cooperation among selfish players. Here, we have considered a one-dimensional lattice, where each cell represents a player, that can cooperate or defect.…

Physics and Society · Physics 2009-04-03 Marcelo Alves Pereira , Alexandre Souto Martinez

Even when concepts similar to emergence have been used since antiquity, we lack an agreed definition. However, emergence has been identified as one of the main features of complex systems. Most would agree on the statement ``life is…

General Physics · Physics 2025-12-22 Carlos Gershenson

Inspired by Turing's famous "imitation game" and recent advances in generative pre-trained transformers, we pose the participation game to point to a new frontier in AI evolution where machines will join with humans as participants in…

Computers and Society · Computer Science 2023-04-26 Mark Thomas Kennedy , Nelson Phillips

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…

Computer Science and Game Theory · Computer Science 2010-06-09 Julien Cristau , Claire David , Florian Horn

Evolutionary games on graphs play an important role in the study of evolution of cooperation in applied biology. Using rigorous mathematical concepts from a dynamical systems and graph theoretical point of view, we formalize the notions of…

Dynamical Systems · Mathematics 2014-11-18 Jeremias Epperlein , Stefan Siegmund , Petr Stehlík

Checklists have been widely recognized as effective tools for completing complex tasks in a systematic manner. Although originally intended for use in procedural tasks, their interpretability and ease of use have led to their adoption for…

Machine Learning · Computer Science 2024-11-27 Yukti Makhija , Edward De Brouwer , Rahul G. Krishnan

A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…

Cellular Automata and Lattice Gases · Physics 2015-06-12 Malgorzata J. Krawczyk , Krzysztof Kulakowski

Probabilistic model checking is a technique for formal automated reasoning about software or hardware systems that operate in the context of uncertainty or stochasticity. It builds upon ideas and techniques from a diverse range of fields,…

Logic in Computer Science · Computer Science 2023-08-08 David Parker

Computer modelling for evolutionary systems consists in: 1) to store in the memory the individual features of each member of a large population; and 2) to update the whole system repeatedly, as time goes by, according to some prescribed…

Statistical Mechanics · Physics 2007-05-23 Paulo Murilo Castro de Oliveira

Cellular automata are discrete and computational models thatcan be shown as general models of complexity. They are used in varied applications to derive the generalized behavior of the presented model. In this paper we have took one such…

Neural and Evolutionary Computing · Computer Science 2020-05-14 Karan Nayak