# cellular automata Published articles for cellular automata. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## The Cellular Automaton Method for Cave Generation DevFeed: [The Cellular Automaton Method for Cave Generation]() Original publisher: [Read original article]() Published: 2012-07-29T20:01:18Z Content type: article Language: en Sources: [Jeremy Kun]() Topics: [Cellular automaton](), [procedural flowers](), [Game Development](), [Simulation](), [Computing]() Tags: [article](), [cellular-automata](), [computing](), [game-development](), [graphics](), [javascript](), [mathematica](), [procedural-generation](), [programming](), [simulation](), [video-games]() ### 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. ## Turing Machines and Conway's Dreams DevFeed: [Turing Machines and Conway's Dreams]() Original publisher: [Read original article]() Published: 2011-06-30T20:50:04Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Automaton]() Tags: [cellular](), [cellular-automata](), [computability-theory](), [computational-complexity](), [conway](), [infinite](), [life](), [mathematics](), [patterns](), [period](), [programming](), [recursion](), [theory](), [turing-machine](), [turing-machines]() ### AI overview The article examines Conway's Game of Life patterns that do not stabilize, including Gosper's glider gun and puffers that produce continuing activity. It connects these patterns to computability, explaining that infinite looping is necessary for Turing-complete computation. ### Source excerpt Additional Patterns Last time we left the reader with the assertion that Conway's game of life does not always stabilize. Specifically, there exist patterns which result in unbounded cell population growth. Although John Conway's original conjecture was that all patterns eventually stabilize (and offered $50 to anyone who could provide a proof or counterexample), he was proven wrong. Here we have the appropriately named glider gun, whose main body oscillates, expelling a glider once per period. ## Introduction to Cellular Automata DevFeed: [Introduction to Cellular Automata]() Original publisher: [Read original article]() Published: 2011-06-29T21:08:45Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Cellular automaton](), [Automaton](), [Finite-state machine]() Tags: [cellular-automata](), [computability-theory](), [conus](), [conway](), [life](), [mathematica](), [mathematics](), [patterns](), [programming](), [rules](), [simulation](), [turing-machine]() ### 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.