# Cellular automaton

Cellular automata are discrete computational systems composed of cells that update synchronously according to local rules, and can serve as universal models of computation.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Attention U-Net Cellular Automata for Multi-Class Land Use and Land Cover Change Simulation in Lucknow, India: Evaluation Against Null and Classical Baselines

DevFeed: [Attention U-Net Cellular Automata for Multi-Class Land Use and Land Cover Change Simulation in Lucknow, India: Evaluation Against Null and Classical Baselines](<https://devfeed.tech/articles/attention-u-net-cellular-automata-for-multi-class-land-use-and-land-cover-change-simulation-in-lucknow-india-evaluation-against-null-and-classical-baselines-137438.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19348>)

Author: Shubham Phapale, Poonam Sharma

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [change](<https://devfeed.tech/tags/change.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [india](<https://devfeed.tech/tags/india.md>)

### AI overview

In Lucknow, only 8.1% of land changed during 2010-2020, so the no-change baseline achieved higher overall agreement (91.9%) than any simulated model. For detecting change, class-weighted U-Net CA scored 22.0 ± 1.2% on figure of merit and AttentionUNet-CA 21.0 ± 1.4%, versus 20.3% for random-forest CA; these differences were comparable to variation across seeds. The networks estimated the amount of change better than RF-CA, while attention gates did not improve accuracy. The model used 32 x 32 neighborhoods, four spatial drivers, and decade-ahead land-cover states. Population density and distance to the CBD were the most useful drivers. Its 2030 projection estimates 22-35% growth in built-up land, mostly at the city edge.

### Source excerpt

arXiv:2611.19348v1 Announce Type: new Abstract: Convolutional networks are often used to learn the transition rules of land-use cellular automata (CA), yet their predictions are seldom compared with a null model that predicts no change. We built AttentionUNet-CA, which reads a 32 x 32 neighbourhood of land-cover states with four drivers (elevation, distance to major roads, distance to the central business district (CBD) and population density) and predicts the state of each cell ten years later. We tested it on Lucknow, India, with GLC_FCS30D land cover for 1990, 2000, 2010 and 2020, a 30 m series mapped consistently over time, and compared its built-up class with GHSL and ESA WorldCover. AttentionUNet-CA was trained on 1990-2010, selected on held-out spatial blocks and evaluated once on 2010-2020, with three seeds. Baselines were the null model, a random-forest CA (RF-CA) and a U-Net CA without attention; each network was trained with and without class weights. Only 8.1% of the study area changed in the test decade, so no model matched the overall agreement of the null model (91.9%). On change, measured by the figure of merit, the class-weighted networks scored highest (U-Net CA 22.0 +/- 1.2%, AttentionUNet-CA 21.0 +/- 1.4%), ahead of RF-CA (20.3%), but by margins comparable to seed-to-seed variation; the networks estimated the amount of change better than RF-CA. The attention gates did not improve accuracy. Population density and distance to the CBD were the most useful drivers. Projected to 2030, built-up land grows by 22-35%, mostly at the city edge.

## Autonomous Mobile Robots on a Computing Field

DevFeed: [Autonomous Mobile Robots on a Computing Field](<https://devfeed.tech/articles/autonomous-mobile-robots-on-a-computing-field-131550.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.16652>)

Author: Yonghwan Kim, Gil-Tak Kong, Un-Sook Choi

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>)

Tags: [autonomous-mobile-robots](<https://devfeed.tech/tags/autonomous-mobile-robots.md>), [cells](<https://devfeed.tech/tags/cells.md>), [cellular](<https://devfeed.tech/tags/cellular.md>), [computing](<https://devfeed.tech/tags/computing.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [environment](<https://devfeed.tech/tags/environment.md>), [explore](<https://devfeed.tech/tags/explore.md>), [field](<https://devfeed.tech/tags/field.md>), [gathering](<https://devfeed.tech/tags/gathering.md>), [grid](<https://devfeed.tech/tags/grid.md>), [memory](<https://devfeed.tech/tags/memory.md>), [model](<https://devfeed.tech/tags/model.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [range](<https://devfeed.tech/tags/range.md>), [solved](<https://devfeed.tech/tags/solved.md>), [spacing](<https://devfeed.tech/tags/spacing.md>), [state](<https://devfeed.tech/tags/state.md>), [torus](<https://devfeed.tech/tags/torus.md>), [under](<https://devfeed.tech/tags/under.md>), [visibility](<https://devfeed.tech/tags/visibility.md>)

### AI overview

CABOT shifts computational resources from robots to the floor: grid cells hold finite states that update synchronously by a local rule sensing robot occupancy, and robots observe visible cell states. The robots remain oblivious, lightless, range-1, unable to detect multiplicity or write to the floor; resource cost is measured by the number of floor states. With an inert floor, these robots cannot form a line, gather, or explore. The abstract reports line formation from connected configurations with four states (five for a field that reaches a fixed point), arbitrary-configuration gathering with three states, and arbitrary line formation with six. The latter two cannot be field-silent at any state count. A single robot explores finite grids forever with four states and tori with two, reported as optimal. Other rule sets for spacing, pattern filling, and maze guidance are validated only by simulation.

### Source excerpt

arXiv:2611.16652v1 Announce Type: new Abstract: We introduce CABOT, a computational model for autonomous mobile robots in which the discrete plane the robots operate on is not a passive stage but an active computing medium. In the classical Look-Compute-Move (LCM) model every increase in computational capability is obtained by strengthening the robots themselves, with lights, memory or wider visibility, at a cost paid once per robot. CABOT strengthens the environment instead: each cell of the grid holds a state from a finite set Q, the states evolve synchronously under a uniform local rule that also senses whether a robot stands on the cell, that is, the floor is a cellular automaton, and the Look operation returns the states of the visible cells in addition to the positions of the visible robots. The robots are as weak as we can make them: oblivious, silent, lightless, myopic with visibility range 1, without multiplicity detection and unable to write to the floor. The number of field states |Q|, rather than any robot capability, becomes the measure of the resources required. On an inert floor (|Q| = 1) such robots can neither form a line, nor gather from scattered positions, nor explore a grid. We show that a handful of states changes this. Line Formation from connected configurations is solvable with four states, and field-silently, so that the floor also reaches a fixed point, with five. Gathering from arbitrary, possibly disconnected, configurations is solvable with three states and Line Formation from arbitrary configurations with six; we prove that neither can be solved field-silently with any number of states. A single robot explores every finite grid forever with four states and every torus with two, which is optimal. Further rule sets, validated by simulation only, equalize the spacing of robots on a row, fill a pattern painted on the floor and guide robots through a maze, and indicate the range of the model.

## Training Language Models via Neural Cellular Automata

DevFeed: [Training Language Models via Neural Cellular Automata](<https://devfeed.tech/articles/training-language-models-via-neural-cellular-automata-131890.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.10055>)

Author: Dan Lee, Seungwook Han, Akarsh Kumar, Pulkit Agrawal

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Large Language Model](<https://devfeed.tech/topics/llm.md>), [LLM Techniques](<https://devfeed.tech/topics/llm-techniques.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Chinchilla scaling law](<https://devfeed.tech/topics/chinchilla-scaling-law.md>)

Tags: [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

The paper proposes pre-pre-training language models on synthetic, non-linguistic data generated by neural cellular automata (NCA), then training on natural language. In 400M-3B models using Chinchilla-optimal data budgets, 164M NCA tokens improved downstream language modeling by up to 6% and accelerated convergence by up to 1.6x; the authors report this outperformed pre-pre-training on 1.6B high-quality natural-language tokens with more compute. They identify attention layers as the most transferable and report that useful NCA complexity varies by domain: simpler dynamics benefit code, while math and web text favor more complex dynamics. These findings suggest synthetic data distributions can be tuned to target domains; the evidence here is limited to the supplied abstract.

### Source excerpt

arXiv:2603.10055v2 Announce Type: replace-cross Abstract: Pre-training is crucial for large language models (LLMs), as it is when most representations and capabilities are acquired. However, natural language pre-training has problems: high-quality text is finite, contains human biases, and entangles knowledge with reasoning. This raises a fundamental question: is natural language the only path to intelligence? We propose using neural cellular automata (NCA) to generate synthetic, non-linguistic data for pre-pre-training LLMs--training on synthetic-then-natural language. NCA data exhibits rich spatiotemporal structure and statistics resembling natural language while being controllable and cheap to generate at scale. We find that pre-pre-training on only 164M NCA tokens improves downstream language modeling by up to 6% and accelerates convergence by up to 1.6x in 400M-3B models trained with Chinchilla optimal data budgets. Surprisingly, this even outperforms pre-pre-training on 1.6B tokens of high-quality natural language data with more compute. Investigating what drives transfer, we find that attention layers are the most transferable, and that optimal NCA complexity varies by domain: code benefits from simpler dynamics, while math and web text favor more complex ones. These results enable systematic tuning of the synthetic distribution to target domains. More broadly, our work opens a path toward more efficient models with fully synthetic pre-training.

## ConwayNet: Interpretability, Activation Coherence, and Noise Resilience via a Game-of-Life-Inspired Lateral Inhibition in Artificial Neural Networks

DevFeed: [ConwayNet: Interpretability, Activation Coherence, and Noise Resilience via a Game-of-Life-Inspired Lateral Inhibition in Artificial Neural Networks](<https://devfeed.tech/articles/conwaynet-interpretability-activation-coherence-and-noise-resilience-via-a-game-of-life-inspired-lateral-inhibition-in-artificial-neural-networks-125249.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.10760>)

Author: Yair Cohen, Scott M. Gilmore

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Deep neural networks](<https://devfeed.tech/topics/deep-neural-networks.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Resilience](<https://devfeed.tech/topics/resilience.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [activation](<https://devfeed.tech/tags/activation.md>), [approximation](<https://devfeed.tech/tags/approximation.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [artificial-neural-networks](<https://devfeed.tech/tags/artificial-neural-networks.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [background](<https://devfeed.tech/tags/background.md>), [based](<https://devfeed.tech/tags/based.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [but](<https://devfeed.tech/tags/but.md>), [coherence](<https://devfeed.tech/tags/coherence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [game](<https://devfeed.tech/tags/game.md>), [interpretability](<https://devfeed.tech/tags/interpretability.md>), [lateral](<https://devfeed.tech/tags/lateral.md>), [life](<https://devfeed.tech/tags/life.md>), [networks](<https://devfeed.tech/tags/networks.md>), [neural](<https://devfeed.tech/tags/neural.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [noise](<https://devfeed.tech/tags/noise.md>), [resilience](<https://devfeed.tech/tags/resilience.md>)

### AI overview

ConwayNet adds differentiable lateral inhibition based on continuous Game-of-Life rules to neural network activations. The mechanism derives excitatory and inhibitory responses from each layer's input; its parameters are fixed rather than learned, while its values and derivatives influence training. The abstract reports use in fully connected, convolutional, wide-residual, and graph convolutional networks. It associates the method with more coherent activation maps, spatially organized hidden-unit co-activation, object-focused saliency, and improved resilience to unseen pixel noise. Under label noise, networks with nearly identical initializations disagree on 30 times fewer test images. These are abstract-level reported findings; the supplied text does not give evaluation details.

### Source excerpt

arXiv:2611.10760v1 Announce Type: new Abstract: Deep neural networks achieve universal function approximation by stacking interconnected nonlinearities, but as a consequence they are sensitive to noise and resist mechanistic interpretation. In contrast, the local update rules of cellular automata, such as Conway's Game of Life, give rise to not merely interpretable but programmable dynamics. We explore a bridge between these worlds: a lateral inhibition in neural networks based on continuous Game-of-Life rules that derives inhibitory and excitatory responses from the layer input and blends them into the activation map in a state-conditioned way. The mechanism is differentiable and architecture-agnostic, and its regulation is imposed rather than learned: the rule's parameters are fixed and are not optimised, while the rule's values and derivatives shape training throughout the network. Wired into fully connected, convolutional, wide-residual and graph convolutional networks, it gives rise to several properties. Activation maps become coherent across space, depth and seeds, with coarse structure persisting through depth while fine detail is renewed at every layer. The co-activation graph of the hidden units departs from an Erd\H{o}s--R\'enyi random graph: it is laid out on the image and its giant component grows in steps, as in a spatial graph. Networks started from nearly identical initialisations, under label noise, disagree on thirty times fewer test images. Saliency maps rest on the object rather than the background, and resilience to pixel noise not seen in training is substantially improved.

## Rule-table structure of life-like cellular automata: activity, asymmetry, sensitivity, and the propagation storage factorisation

DevFeed: [Rule-table structure of life-like cellular automata: activity, asymmetry, sensitivity, and the propagation storage factorisation](<https://devfeed.tech/articles/rule-table-structure-of-life-like-cellular-automata-activity-asymmetry-sensitivity-and-the-propagation-storage-factorisation-125287.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.10969>)

Author: Yair Cohen

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>)

Tags: [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [conway](<https://devfeed.tech/tags/conway.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [exhaustive](<https://devfeed.tech/tags/exhaustive.md>), [life](<https://devfeed.tech/tags/life.md>), [q-bio-pe](<https://devfeed.tech/tags/q-bio-pe.md>), [sensitivity-labels](<https://devfeed.tech/tags/sensitivity-labels.md>), [storage](<https://devfeed.tech/tags/storage.md>), [structure](<https://devfeed.tech/tags/structure.md>), [table](<https://devfeed.tech/tags/table.md>)

### AI overview

Across 262,144 two-dimensional outer-totalistic cellular automaton rules, the paper combines three symmetry-derived rule-table coordinates with an exhaustive catalog of compact gliders, still lifes and oscillators from 3x3 seeds, with periods up to 16. It reports a hierarchy in which birth conditions gate propagation while survival conditions tune storage; compact-glider-supporting rules are birth-light and survival-rich. The exact exclusion is limited to compact-footprint patterns: no centre-blind B=S rule supports a compact glider at the tested footprint, while examples appear at 4x4 and 5x5 seeds. The work also finds that rule tables can certify glider capability even when random sampling does not express it, and that uncatalogued rules with richly Life-like ecologies behave like Conway or HighLife on neighbor counts their trajectories visit. Activity and cardinality coordinates alone are not sufficient to certify behavior.

### Source excerpt

arXiv:2611.10969v1 Announce Type: cross Abstract: What structure on the rule space of a cellular-automaton family exposes which rules can support which behaviours? For the 262,144 life-like rules -- the two-dimensional outer-totalistic family containing Conway's Game of Life -- the standard coordinate, Langton's activity parameter, is long known to be too coarse. I organise the family by three symmetry-derived rule-table coordinates: an unweighted activity, a birth-survival asymmetry (odd under the swap of birth and survival), and the Vichniac-Binder Boolean-derivative sensitivity in closed form, whose centre-bit component vanishes exactly on the centre-blind (B=S) submanifold. The cardinality coordinates lambda, delta are necessary but never sufficient to certify behaviour; the centre-bit sensitivity labels the B=S submanifold on which the paper's one exact exclusion holds. Combined with an exhaustive enumeration of every rule's compact gliders, still lifes and oscillators (three-by-three seed, period at most sixteen), they expose a hierarchical factorisation: the birth condition is a narrow gate deciding whether anything can propagate, the survival condition tunes storage, and every compact-glider-supporting rule is birth-light and survival-rich. One exclusion is exact: no B=S rule supports a compact glider at that footprint, proven by exhaustive enumeration and closing only for compact-footprint patterns -- 36 B=S rules ship at four-by-four seed and 40 at five-by-five. Two dynamical results frame the whole: glider-capable rules that random sampling never expresses show that capability is certifiable from the table while its expression is only estimable from dynamics; and every uncatalogued rule producing a richly Life-like ecology turns out to be a Conway or HighLife variant on the neighbour counts its trajectories actually visit.

## Slower Generalization, Faster Memorization: A Sweet Spot in Algorithmic Learning

DevFeed: [Slower Generalization, Faster Memorization: A Sweet Spot in Algorithmic Learning](<https://devfeed.tech/articles/slower-generalization-faster-memorization-a-sweet-spot-in-algorithmic-learning-116702.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2605.14659>)

Author: Shin So, Kyelim Lee, Albert No

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>)

Tags: [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [dependencies](<https://devfeed.tech/tags/dependencies.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [generation](<https://devfeed.tech/tags/generation.md>), [input](<https://devfeed.tech/tags/input.md>), [intermediate](<https://devfeed.tech/tags/intermediate.md>), [learning](<https://devfeed.tech/tags/learning.md>), [random](<https://devfeed.tech/tags/random.md>), [relationships](<https://devfeed.tech/tags/relationships.md>), [rules](<https://devfeed.tech/tags/rules.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [training](<https://devfeed.tech/tags/training.md>), [transformers](<https://devfeed.tech/tags/transformers.md>), [validation](<https://devfeed.tech/tags/validation.md>)

### AI overview

Small Transformers reached high exact-match validation accuracy on Needleman-Wunsch matrices in the fewest optimizer updates with an intermediate dataset size; larger datasets converged more slowly. A random-suffix probe found that models fit the structured matrices before memorizing random suffixes at larger sizes. In elementary cellular automata, lower-order predictive signals helped explain learnability: finite-sample fluctuations in Rule 90 created output biases and single-input dependencies absent from the uniform population, and these signals weakened as datasets grew. Training with such biases accelerated generalization on an unchanged uniform validation distribution. The findings suggest sampling fluctuations can help models acquire rules, though the evidence here is limited to the described tasks and experiments.

### Source excerpt

arXiv:2605.14659v2 Announce Type: replace Abstract: Once generalization becomes possible, does adding more data always make learning faster? In Needleman-Wunsch matrix generation, we find that small Transformers reach high exact-match validation accuracy in the fewest optimizer updates at an intermediate dataset size, while larger datasets converge more slowly. A random-suffix probe shows that, at larger dataset sizes, models fit the structured matrices before memorizing their random suffixes, suggesting that shared rule learning aids training-set fitting. To examine what makes rules easier to learn, we study elementary cellular automata (ECA), in which each binary cell updates from its own state and those of its two neighbors. These experiments identify lower-order predictive signals-output biases or predictive relationships involving only a few input bits-as a key factor in learnability. In Rule 90, finite-sample fluctuations create output biases and single-input dependencies absent from the uniform population. These signals weaken as the dataset grows. Biased training that introduces these signals accelerates generalization on an unchanged uniform validation distribution. These results support an explanation for faster convergence at intermediate dataset sizes: sampling fluctuations can facilitate rule acquisition, and larger datasets weaken this advantage.

## New classes of reversible cellular automata

DevFeed: [New classes of reversible cellular automata](<https://devfeed.tech/articles/new-classes-of-reversible-cellular-automata-113968.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2411.00721>)

Author: Jan Kristian Haugland, Tron Omland

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [boolean](<https://devfeed.tech/tags/boolean.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [classification](<https://devfeed.tech/tags/classification.md>), [computer-science](<https://devfeed.tech/tags/computer-science.md>), [cryptanalysis](<https://devfeed.tech/tags/cryptanalysis.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dm](<https://devfeed.tech/tags/cs-dm.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [math-co](<https://devfeed.tech/tags/math-co.md>), [math-ds](<https://devfeed.tech/tags/math-ds.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [open-problems](<https://devfeed.tech/tags/open-problems.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

The paper constructs new classes of reversible cellular automata by composing landscape functions that induce proper liftings of Boolean functions. It examines their cryptographic potential using indicators for differential and linear cryptanalysis, and combines theoretical and computational methods to classify proper liftings completely for diameters up to 6. The abstract also identifies open problems and conjectures; it does not specify the results of the cryptographic analyses.

### Source excerpt

arXiv:2411.00721v2 Announce Type: replace-cross Abstract: Cellular automata find applications in cryptography, error correction, theoretical computer science, and the simulation of physical and biological processes. We say that a Boolean function is a proper lifting if its induced cellular automaton is reversible. This paper introduces new classes of proper liftings, constructed through compositions of landscape functions, and explores their cryptographic potential by computing indicators relevant to differential and linear cryptanalysis. We combine theoretical and computational methods to obtain a complete classification of proper liftings for diameters up to $6$. Several open problems and conjectures are posed along the way.

## Infinite Worlds from One Example: What Local Generators Must Share

DevFeed: [Infinite Worlds from One Example: What Local Generators Must Share](<https://devfeed.tech/articles/infinite-worlds-from-one-example-what-local-generators-must-share-114483.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.01048>)

Author: Amin Najafgholizadeh, Mohsen Afsharchi

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [cellular](<https://devfeed.tech/tags/cellular.md>), [cs-gr](<https://devfeed.tech/tags/cs-gr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [generators](<https://devfeed.tech/tags/generators.md>), [infinite](<https://devfeed.tech/tags/infinite.md>), [learning](<https://devfeed.tech/tags/learning.md>), [local](<https://devfeed.tech/tags/local.md>), [noise](<https://devfeed.tech/tags/noise.md>), [randomness](<https://devfeed.tech/tags/randomness.md>), [region](<https://devfeed.tech/tags/region.md>), [repair](<https://devfeed.tech/tags/repair.md>), [statistics](<https://devfeed.tech/tags/statistics.md>)

### AI overview

For local generators to produce exactly valid worlds while preserving an example's statistics when constraints encode quantities that vary across it, they need randomness shared along the relevant direction. The paper says position-independent rules on independent per-cell randomness cannot meet both goals, regardless of how far each cell reads; at radius r, faithful output entails forbidden windows at density at least order 1/r, and a construction attains that rate. A finite-checkable condition lets row types drawn from the seed and position modulo a fixed period ensure exact validity without learning. In experiments, the authors' patch search certified examples where learned generators using independent randomness remained far from valid after repair. With the identified input, a neural cellular automaton and diffusion model met the stated threshold--at most one forbidden window per thousand--on 10 and 8 of 12 certified examples, respectively, and on none without that input. Using octaves of seeded noise elsewhere, the automaton met the threshold on 45/52 public examples and 21/27 from other implementations; repair preserved random access.

### Source excerpt

arXiv:2611.01048v1 Announce Type: new Abstract: Seeded noise lets games generate any region of an unbounded world on demand. We ask what such a generator needs when every small window must come from one example, the constraint behind Wave Function Collapse. The difficulty is that local constraints can require agreement over arbitrary distances: in a brick wall, each row keeps its place between the mortar lines. We study local generators, each cell a fixed function of the randomness near it. When the constraints carry a quantity that varies across the example, no generator that applies one rule, ignoring position, to independent randomness at every cell can be both exactly valid and faithful to the example's statistics, however far each cell reads. At radius r, staying faithful forces forbidden windows at a density of at least order 1/r, and a construction attains this order. To vary the quantity between exactly valid worlds, a generator needs randomness shared along its direction. We give a finitely checkable condition under which row types drawn from the seed and the position modulo a fixed period suffice for exact validity without learning. A search over the example's patches certifies these quantities and names the input each needs. Across 52 public examples of Wave Function Collapse and 27 from other implementations, it certifies only examples where a learned generator on independent randomness stays far from valid after repair. Given that input, a neural cellular automaton and a diffusion model become valid on 10 and 8 of the 12 certified examples that receive one, and on none from independent randomness. Valid means at most one forbidden window in a thousand after repair. With octaves of seeded noise elsewhere, the automaton is valid on 45 of the 52 public examples and 21 of the 27 from other implementations, and repair keeps random access.

## The Man from the Future: Why Johnny Can't Stop Abstracting

DevFeed: [The Man from the Future: Why Johnny Can't Stop Abstracting](<https://devfeed.tech/articles/the-man-from-the-future-why-johnny-can-t-stop-abstracting-100985.md>)

Original publisher: [Read original article](<https://muratbuffalo.blogspot.com/2026/10/the-man-from-future-why-johnny-cant.html>)

Author: Murat (noreply@blogger.com)

Published: 2026-10-26T06:28:12Z

Content type: article

Language: en

Sources: [Metadata](<https://devfeed.tech/sources/metadata.md>)

Topics: [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>)

Tags: [abstraction](<https://devfeed.tech/tags/abstraction.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [biology](<https://devfeed.tech/tags/biology.md>), [book-review](<https://devfeed.tech/tags/book-review.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [computing](<https://devfeed.tech/tags/computing.md>), [economics](<https://devfeed.tech/tags/economics.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [monte-carlo](<https://devfeed.tech/tags/monte-carlo.md>), [quantum-mechanics](<https://devfeed.tech/tags/quantum-mechanics.md>), [set-theory](<https://devfeed.tech/tags/set-theory.md>), [weather-prediction](<https://devfeed.tech/tags/weather-prediction.md>)

### AI overview

The article presents John von Neumann's recurring strength as abstraction: identifying the simplest structure beneath a difficult problem. It traces that approach from his set theory and rigorous formulation of quantum mechanics to game theory, stored-program computing, fault-tolerant systems, and self-reproducing automata. The author also describes the limits and costs of his methods: von Neumann's game theory framework centered on zero-sum play, and the article argues that his simplified Cold War model led him toward dangerous nuclear-strike advocacy. In a 1955 essay, he rejected banning particular technologies as a workable safeguard, arguing that technology was too interconnected and that prohibition would not be heeded. He instead proposed a continuing series of small, correct decisions guided by patience, flexibility, and intelligence.

### Source excerpt

I have come to suspect that to most people thinking is painful. Some of us are addicted to thinking. Some of us find it a necessity. Johnny enjoyed it. I even have the suspicion that he enjoyed almost nothing else. -- Edward Teller, eulogizing John von Neumann I listened to Ananyo Bhattacharya's "The Man from the Future: The Visionary Life of John von Neumann" in my car during the many commute hours Bay Area traffic afforded me. I thought I should share the Johnny phenomena here. I knew about von Neumann being a very influential mathematician/scientist/engineer but the full list still left me bedazzled. In his 53 years of life (1903-1957), von Neumann seeded so many fields. Every time there was an important discovery in physics, mathematics or computation, John von Neumann was there. Set theory and the foundations of mathematics. The mathematical formulation of quantum mechanics. Operator algebras (still called von Neumann algebras). Ergodic theory. Game theory. Expected utility theory (which is the foundation of most of modern mathematical economics). The Monte Carlo method. The stored-program computer architecture that every machine you have ever touched is built on. Numerical weather prediction. Fault-tolerant computing. Self-reproducing automata (cellular automata), and arguably, the logical structure of molecular biology, four years before Watson and Crick. There is also, unfortunately, the implosion lens for the Nagasaki bomb, and a decade of hawkish nuclear strategy. Early years At six, Janos (the OG hungarian name for Johnny) could divide eight-digit numbers in his head and hold a conversation in ancient Greek. He later added Latin, French, German, English, and Yiddish. The rumor was that he remembered everything he ever read. Many years later Herman Goldstine decided to test this by asking him to recite "A Tale of Two Cities." Von Neumann started on chapter one and had to be asked to stop fifteen minutes later. Budapest around 1900 produced an absurd cluste

## Coding Challenge #133 - Particle Playground

DevFeed: [Coding Challenge #133 - Particle Playground](<https://devfeed.tech/articles/coding-challenge-133-particle-playground-29208.md>)

Original publisher: [Read original article](<https://codingchallenges.substack.com/p/coding-challenge-133-particle-playground>)

Author: John Crickett

Published: 2026-08-22T08:01:30Z

Content type: tutorial

Language: en

Sources: [Coding Challenges](<https://devfeed.tech/sources/coding-challenges.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [creative coding](<https://devfeed.tech/topics/creative-coding.md>), [Graphics](<https://devfeed.tech/topics/graphics.md>), [Canvas](<https://devfeed.tech/topics/canvas.md>)

Tags: [canvas](<https://devfeed.tech/tags/canvas.md>), [coding](<https://devfeed.tech/tags/coding.md>), [creative-coding](<https://devfeed.tech/tags/creative-coding.md>), [graphics](<https://devfeed.tech/tags/graphics.md>), [programming](<https://devfeed.tech/tags/programming.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

A coding challenge guides readers through building a 2D particle playground with two simulation engines: a force-based particle system and a cellular automaton. The project combines materials such as sand, water, and fire with a fireworks display whose embers can ignite the material grid.

### Source excerpt

This challenge is to build your own particle playground.

## Conway's Game of Life

DevFeed: [Conway's Game of Life](<https://devfeed.tech/articles/conway-s-game-of-life-4506.md>)

Original publisher: [Read original article](<https://feeds.feedblitz.com/~/921267023/0/baeldung/cs>)

Author: DrMax

Published: 2025-07-06T22:40:06Z

Content type: article

Language: en

Sources: [Baeldung - CS](<https://devfeed.tech/sources/baeldung-cs.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [computational complexity](<https://devfeed.tech/topics/computational-complexity.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [algorithms-complexity](<https://devfeed.tech/tags/algorithms-complexity.md>), [beacon](<https://devfeed.tech/tags/beacon.md>), [block](<https://devfeed.tech/tags/block.md>), [cells](<https://devfeed.tech/tags/cells.md>), [cellular](<https://devfeed.tech/tags/cellular.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [chaos](<https://devfeed.tech/tags/chaos.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [complexity-theory](<https://devfeed.tech/tags/complexity-theory.md>), [conway](<https://devfeed.tech/tags/conway.md>), [cycles](<https://devfeed.tech/tags/cycles.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [game](<https://devfeed.tech/tags/game.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generator](<https://devfeed.tech/tags/generator.md>), [grid](<https://devfeed.tech/tags/grid.md>), [growth](<https://devfeed.tech/tags/growth.md>), [gun](<https://devfeed.tech/tags/gun.md>), [infinite](<https://devfeed.tech/tags/infinite.md>), [life](<https://devfeed.tech/tags/life.md>), [pattern](<https://devfeed.tech/tags/pattern.md>)

### AI overview

Conway's Game of Life applies four neighbor-count rules to a two-dimensional grid, producing behavior beyond the rules' simplicity. Live cells die with fewer than two or more than three live neighbors and otherwise survive; dead cells become alive with exactly three. The excerpt describes still lives that remain unchanged, oscillators that cycle, spaceships such as the Glider that move while repeating their shape, and guns that emit patterns at intervals. The Gosper Glider Gun releases a Glider every 30 generations; the text says such patterns demonstrate unbounded growth and, through interacting Gliders, contribute to the Game of Life's Turing completeness. It also highlights how local interactions and small changes in starting cells can shape global outcomes.

### Source excerpt

Learn about various pattern types in Conway's Game of Life. The post Conway's Game of Life first appeared on Baeldung on Computer Science. Related Stories How to Find the Complexity of an Algorithm Raft Consensus Algorithm Gale-Shapley Algorithm

## Building Langton's Ant in Elm

DevFeed: [Building Langton's Ant in Elm](<https://devfeed.tech/articles/building-langton-s-ant-in-elm-52510.md>)

Original publisher: [Read original article](<http://www.jackfranklin.co.uk/blog/langtons-ant-elm-lang/>)

Published: 2017-03-14T00:00:00Z

Content type: tutorial

Language: en

Sources: [Jack Franklin](<https://devfeed.tech/sources/jack-franklin.md>)

Topics: [Elm](<https://devfeed.tech/topics/elm.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [data type](<https://devfeed.tech/topics/data-type.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Functional programming](<https://devfeed.tech/topics/functional-programming.md>), [union types](<https://devfeed.tech/topics/union-types.md>), [enum](<https://devfeed.tech/topics/enum.md>), [Learning](<https://devfeed.tech/topics/learning.md>), [Publish-subscribe pattern](<https://devfeed.tech/topics/pubsub.md>)

Tags: [board](<https://devfeed.tech/tags/board.md>), [building](<https://devfeed.tech/tags/building.md>), [conway](<https://devfeed.tech/tags/conway.md>), [css](<https://devfeed.tech/tags/css.md>), [elm](<https://devfeed.tech/tags/elm.md>), [game](<https://devfeed.tech/tags/game.md>), [type-alias](<https://devfeed.tech/tags/type-alias.md>), [types](<https://devfeed.tech/tags/types.md>), [union](<https://devfeed.tech/tags/union.md>)

### AI overview

The article implements Langton's Ant in Elm by modeling the ant, direction, cell colors, coordinates, and board with Elm types. It stores cells in a coordinate-keyed `Dict`, treating missing cells as white, then advances each millisecond tick by flipping the current cell, turning according to its original color, and moving one square. It uses `create-elm-app` to start the project and `elm-lang/svg` to render cells and the ant in a centered SVG viewBox. The author presents explicit types as a way to shape the application and let the compiler guide later changes. The supplied text ends with the implementation and rendering; it does not provide the linked full code.

### Source excerpt

Last week I attended the Elm London meetup, arranged by Kris Jenkins, who always produces a great selection of challenges for people to take on for all skill levels. Along with Isaac, we decided to take on Kris' challenge to build Langton's Ant in Elm. Langton's Ant Langton's Ant is a game similar to Conway's Game of Life in that cells on a game board change from being alive to dead based on their surroundings and certain criteria. In Langton's Ant there is a small ant on the board that moves and changes squares as it goes. The ant starts on any random square, and on each move it: Based on the colour of the square, it either turns 90 degrees right, or 90 degrees left. Changes the colour of the square it's on from black to white, or vice versa. Moves forward one square in the direction it's facing. The fact that the game has well defined rules makes it perfect for a short hack event, so we set about building it in Elm. Getting started I used create-elm-app to quickly get the app going. It's a really handy way to get a working application and local server up without having to think about it, and I highly recommend it. Defining types When working in Elm the first thing I always do is define the types for the key concepts of the application. Looking through Langton's ant, we could see we'd need to model: The concept of an Ant. Cells on a game Board. Coords which cells are positioned at on the board. The Direction of the ant. The Colour of a cell. Starting with the easier ones, a Direction is a union type that can be one of Up, Down, Left or Right: type Direction = Up | Down | Left | Right And similarly, a Colour is either White or Black: type Colour = White | Black And a coordinate, or Coord, is a tuple of (x, y): type alias Coord = ( Int, Int ) Once you have these, it's easy to combine them to make up the "bigger" types. A cell is a record that has a coordinate pair and a colour: type alias Cell = { position : Coord , colour : Colour } And the Ant is a record with a po

## The Cellular Automaton Method for Cave Generation

DevFeed: [The Cellular Automaton Method for Cave Generation](<https://devfeed.tech/articles/the-cellular-automaton-method-for-cave-generation-40282.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2012/07/29/the-cellular-automaton-method-for-cave-generation/>)

Published: 2012-07-29T20:01:18Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [procedural flowers](<https://devfeed.tech/topics/procedural-flowers.md>), [Game Development](<https://devfeed.tech/topics/game-development.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Computing](<https://devfeed.tech/topics/computing.md>)

Tags: [article](<https://devfeed.tech/tags/article.md>), [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [computing](<https://devfeed.tech/tags/computing.md>), [game-development](<https://devfeed.tech/tags/game-development.md>), [graphics](<https://devfeed.tech/tags/graphics.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [mathematica](<https://devfeed.tech/tags/mathematica.md>), [procedural-generation](<https://devfeed.tech/tags/procedural-generation.md>), [programming](<https://devfeed.tech/tags/programming.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [video-games](<https://devfeed.tech/tags/video-games.md>)

### AI overview

This article examines a practical application of cellular automata: procedural generation of cave-like levels in video games. It explains how randomized level generation can reduce hand-crafted design effort and increase replay value, placing the technique in the broader history of procedural content generation.

### Source excerpt

Dear reader, this post has an interactive simulation! We encourage you to play with it as you read the article below. In our series of posts on cellular automata, we explored Conway's classic Game of Life and discovered some interesting patterns therein. And then in our primers on computing theory, we built up a theoretical foundation for similar kinds of machines, including a discussion of Turing machines and the various computational complexity classes surrounding them.

## Introduction to Cellular Automata

DevFeed: [Introduction to Cellular Automata](<https://devfeed.tech/articles/the-wild-world-of-cellular-automata-40214.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2011/06/29/conways-game-of-life/>)

Published: 2011-06-29T21:08:45Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>), [Automaton](<https://devfeed.tech/topics/automaton.md>), [Finite-state machine](<https://devfeed.tech/topics/finite-state-machine.md>)

Tags: [cellular-automata](<https://devfeed.tech/tags/cellular-automata.md>), [computability-theory](<https://devfeed.tech/tags/computability-theory.md>), [conus](<https://devfeed.tech/tags/conus.md>), [conway](<https://devfeed.tech/tags/conway.md>), [life](<https://devfeed.tech/tags/life.md>), [mathematica](<https://devfeed.tech/tags/mathematica.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [patterns](<https://devfeed.tech/tags/patterns.md>), [programming](<https://devfeed.tech/tags/programming.md>), [rules](<https://devfeed.tech/tags/rules.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [turing-machine](<https://devfeed.tech/tags/turing-machine.md>)

### AI overview

An introductory tutorial on cellular automata, explaining cells, states, transition rules, simultaneous updates, and a one-dimensional binary example.

### Source excerpt

Cellular Automata There is a long history of mathematical models for computation. One very important one is the Turing Machine, which is the foundation of our implementations of actual computers today. On the other end of the spectrum, one of the simpler models of computation (often simply called a system) is a cellular automaton. Surprisingly enough, there are deep connections between the two. But before we get ahead of ourselves, let's see what these automata can do.

## Simple Rules, Complex Systems and Software Development

DevFeed: [Simple Rules, Complex Systems and Software Development](<https://devfeed.tech/articles/simple-rules-complex-systems-and-software-development-30407.md>)

Original publisher: [Read original article](<https://www.mdubakov.com/posts/simple-rules-complex-systems-software-development/>)

Published: 2009-03-23T15:41:57Z

Content type: article

Language: en

Sources: [Michael Dubakov](<https://devfeed.tech/sources/blog-by-michael-dubakov.md>)

Topics: [Complex Systems](<https://devfeed.tech/topics/complex-systems.md>), [Agile](<https://devfeed.tech/topics/agile.md>), [software-development](<https://devfeed.tech/topics/software-development.md>), [Software Engineering](<https://devfeed.tech/topics/software-engineering.md>), [Cellular automaton](<https://devfeed.tech/topics/cellular-automaton.md>)

Tags: [agile](<https://devfeed.tech/tags/agile.md>), [communication](<https://devfeed.tech/tags/communication.md>), [complex-systems](<https://devfeed.tech/tags/complex-systems.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [development](<https://devfeed.tech/tags/development.md>), [development-process](<https://devfeed.tech/tags/development-process.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [rules](<https://devfeed.tech/tags/rules.md>), [simple](<https://devfeed.tech/tags/simple.md>), [software](<https://devfeed.tech/tags/software.md>), [software-development](<https://devfeed.tech/tags/software-development.md>)

### AI overview

The source argues that simple local rules can produce complex behavior, illustrating the idea with ants' scent trails, flocking principles, and Conway's Game of Life. It then applies this to software development: complex processes can encourage mechanical behavior, while Scrum's small set of roles, rules, and artifacts is presented as a way to support learning, feedback, communication, and cooperation. The source notes that implementing Scrum can be difficult because people may resist changing habits, and warns that deep management hierarchies and lengthy process documents can add unnecessary complexity.

### Source excerpt

Many complex systems are based on simple rules. A set of several simple rules leads to complex, intelligent behavior. While a set of complex rules often leads to a dumb and primitive behavior. There are many examples. Ants Colony How ants search for food? They do not have cell phones, cars and mini-markets near the nest. They should have something simpler to communicate. Here is how ants work: Travel randomly in search for food. Take a piece of food and head straight back to the nest. On the way back to the nest lay down an odor trail. Notify nestmates of the discovered food encouraging them to leave the nest. These newly recruited ants will follow the odor trail directly to the food source. In their turn, each ant will reinforce the odor trail until the food is gone. Sounds simple? Take a look at this very nice ants colony model. Drop some food and enjoy the action. Birds Flocks Birds flocks are beautiful. You may think that the movement gets orchestrated by one savvy bird. But this is not the case. A bird glock is guided by three simple principles (every decent bird knows them): Separation: steer to avoid stumbling upon local flockmates. Alignment: steer towards the average heading of local flockmates. Cohesion: steer to move towards the average position of local flockmates. Simple? Yes, it is. Look at the picture on the right. It's just amazing! Game of Life Game of Life was invented in 1970 by John Conway. It is a cellular automaton and simulates the birth, death, etc., of organisms based on certain rules: Each cell with one or no neighbors dies, as if of loneliness. Each cell with four or more neighbors dies, as if of overpopulation. Each cell with two or three neighbors survives. Each empty cell with three neighbors becomes populated. Simple rules. But these rules lead to fantastic diversity of the forms. Different types of the forms have been discovered e.g. still objects, oscillators, gliders, spaceships, etc. It is impossible to predict the state of a syste