Questions tagged [cellular-automata]

A computational model composed of a grid of stateful cells and a set of rules describing when to change a cell's state.

76 questions
Filter by
Sorted by
Tagged with
45 views

Difference between this grammar

I was reading a book and there is a part in which they use this grammar $$X \rightarrow xY$$ $$Y \rightarrow yZ$$ $$Z \rightarrow z$$ $$Z \rightarrow \lambda$$ and other times they use this ...
1 vote
59 views

What is the meaning of conservative dynamics in the context of Conway's Game of Life

While reading up about Conway's Game of Life, I often come across the term conservative or non-conservative dynamics. What exactly does these terms mean? My guess is that a certain quantity (e.g., ...
• 21
12 views

Textbook request for Linear Cellular Automata, if possible with an abstract algebraic approach

I am a final semester pure math undergrad, and I became interested in Linear Cellular Automatas.I became interested after reading Klaus Sutner's article. In the article, a little abstract algebra is ...
65 views

Complexity of still life extentions in Game of Life

The game of life is one of the most famous cellular automata in 2D. It has a variety of objects, some of them are moving like gliders, some have an oscillating behavior and others do not change at all,...
• 51
27 views

Calculate complexity of game of life(cellular automata) [duplicate]

I want to calculate the kolmogorov complexity of n evolution of a game of game of life(game of life is a kind of cellular automata). I’m not searching for the complexity of a certain pattern of cells ...
53 views

calculate kolmogorov complexity in the game of life

In order to calculate the Kolmogorov complexity one has to "count" the minimum amount of operations it takes for a certain task(from here). Since the game of life (or cellular automata) ...
79 views

What are the differences/relationship between 2D Turing Machines and Cellular Automata

I have been reading up on 2D Turing machines on wolframscience and I am kind of confused about what exactly is the relationship between 2D Turing machines (like Paterson's worm and Langton's Ant) and ...
• 103
1 vote
133 views

Had Conway's Game of Life or any C-A been demonstrated to generate non-repeating pattern?

As we know, Conway's Game of Life is Turing-complete. And Turing-complete systems can be used to calculate irrational numbers such as $\sqrt{2}$, $\pi$, $e$, etc. which have non-repeating digits. So ...
• 151
109 views

Whats the signifgance of Conway's Game of Life?

I've seen Conway's game of life mentioned in different circles and it seems many people (myself included) have made an implementation of it at one point or another. Other than the fact that it is ...
• 175
80 views

Is it possible to reverse engineer cellular automata?

Given a sequence of states of a given cellular automata, is it possible to construct the rules of the automata & hence predict the next state? To be clear, initially the rules are NOT known but ...
• 131
26 views

How does the railway model of computation get translated to motion on the heptagrid tiling of the hyperbolic plane?

I have been reading these, along with slowly chipping away at the two books Margenstern has produced: A universal cellular automaton in the hyperbolic plane A Universal Cellular Automaton on the ...
• 1,853
50 views

Generalization of Cellular Automata

So in the little I know about formalization of cellular automata, it appears there are 4 major categories of cellular automata: 1-dimensional (cellular automata on the line) 2-dimensional (cellular ...
• 1,853
566 views

Does P = NP in Cellular Automata of Hyperbolic Spaces?

I read a few years ago in this book that NP problems are tractable in the space of cellular automata in the hyperbolic plane. What does this mean? Does P = NP ...
• 1,853
74 views

2d cellular automata Wolfram binary codes

This is a similar question to How 2d cellular automata rules works? However, the answer there did not provide me what I am looking for. Specifically, I want to be able to render these 2d cellular ...
132 views

Conway's Game of Life: Is it really P-complete?

Wikipedia claims that the Game of Life is P-complete (or the decision problem version of it is; the function version, I suppose, would then be FP-complete). Colloquially, P-complete and FP-complete ...
• 153
54 views

What type of cellular automata is this?

So, this is kind of a long shot, but does anybody here familiar with cellular automata know what type this is? In the game, it starts as a flat pink/red and then becomes this over the course of a few ...
1 vote
20 views

Intuition behind cellular automaton mixed bulking function?

I'm reading the paper of Nicolas Ollinger on intrisically universal 1d cellular automata: https://arxiv.org/abs/0906.3213. On page 3 (201), he gave the definition for mixed bulking quasi order. I'm ...
1 vote
136 views

How to effectively represent and generate 2D cellular automaton rules that are invariant under rotation and reflection of the input matrix?

Consider cellular automaton rules for a two-dimensional universe with two states, where a cell's new state can depend on its previous state and the states of the cells in its Moore neighborhood. Such ...
208 views

Langton's Ant Periodic Behavior

I was wondering if there's any initial configuration which generates a pure periodic behavior for Langton's Ant?
• 43
1 vote
74 views

Does any algorithm exist for computing the state of a non-trivial cellular automaton after an arbitrary number of time steps?

If have a cellular automaton, can I see the state of the board after something like $10^{{10}^{10}}$ time steps? For trivial cases, this is possible - for example, a cellular automaton where the state ...
1 vote
19 views

Do all Cellular Automata have some kind of information boundary? Can all Cellular Automata be modelled with the Bekenstein Bound?

Since they are discrete models, do they have some kind of information boundary? Can all Cellular Automata models be related to the Bekenstein Bound? https://en.wikipedia.org/wiki/Bekenstein_bound
• 111
192 views

Do Stephen Wolfram and Gerard 't Hooft propose that literally every cellular automaton is a universe?

Both Stephen Wolfram and Nobel laureate Gerard 't Hooft think that the universe is a cellular automaton. As far as I know, 't Hooft developed a series of frameworks to build different models of ...
• 1
38 views

Why can't we generate the output of a cellular automata at time step t without first generating all the preceding states

Why can't we generate the output of cellular automata at time step t without first generating all the preceding states? Why can we do this for some functions? What features of a function does it ...
98 views

Is there any model of Game of Life compatible with hypercomputation?

I found a question in Mathematics Stack Exchange which asks a very similar question (https://math.stackexchange.com/questions/1023812/hypercomputation-higher-dimensional-variants-of-conways-game-of-...
63 views

• 209
1 vote
541 views

How 2d cellular automata rules works?

How 2D Cellular Automata rules sequences works? For example, in elementary cellular automata, when we look at the binary sequence of the rule number, we understand that first bit says if all neighbors ...
• 119
92 views

Classes of outer totalistic cellular automata

I'm wondering if anyone knows of any place where the Wolfram classifications of many outer totalistic cellular automata have been catalogued. The classes of a few examples are given in A New Kind of ...
• 103
2k views

Turing-completeness, Conway's Game of Life and Logical Gates

I was recently given an assignment at university asking me to discuss the universal computational capability of Conway's Game of Life. I'm not required to actually build up a Universal Turing machine ...
• 215
33 views

Binary arrays for cellular automata

Where can I download some interesting cellular arrays for Conway's Game of Life? Arrays such as the Gosper glider gun, etc? I can find the images easily enough, but are they available somewhere in ...
• 216
46 views

Need introductory guide to cellular automata for geographic automata systems

I would like to work on urbanisation and I've read that cellular automata has potential use on model urban sprawl. However I need some kind of introductory to cellular automata in order to tackle an ...
97 views

Is there any field that studies the equivalent of cellular automata, but for arbitrary graphs rather than 1D cells?

A cellular automaton consists of a sequence of cells, each with a state, and a globally symmetric transition rule based on the neighbors of a cell. They can be interpreted as graphs where each cell is ...
• 4,017
1 vote
85 views

Simple elementary cellular automata with high period?

I'm looking for a simple rewrite system which displays high period. In order to do that, I've ran a brute-force search on every elementary cellular automata, for a few fixed memory lengths ...
• 4,017
24 views

How to identify strongly confluent cellular automatas?

Lets represent a class of cellular automata as a finite, unidimensional bit array state : [Bit], plus a rewrite rule ...
• 4,017
56 views

Is there any count-preserving cellular automata which tends do "10101010..."?

Suppose that I have a bit string of finite length. Is there any bit rewriting rule rewrire :: (Bit,Bit,Bit) -> (Bit,Bit,Bit), that doesn't change the total count ...
• 4,017
183 views

What does Cellular Automata Pre-image problem actually means?

I am reading about Cellular Automata and Computational Complexity and i found a related paper by F. Green, NP-Complete Problems in Cellular Automata. In the 2nd page he lists three NP-Complete ...
• 143
291 views

Complexity of $n \times \log n$ tiling problem

Is there a polynomial time algorithm for an $n \times \log n$ tiling problem? For instance: Suppose $A$ is a finite alphabet. A tile is a $2 \times 2$ matrix of elements from $A$. A tiling is a ...
• 139
489 views

Is the halting problem decidable for 3 symbol one dimensional cellular automata?

I've been trying to figure out if the halting problem is decidable for 3-symbol one-dimensional cellular automata. Definition Let $f(w,i)$ denote the configuration of the system at time step $i$. ...
1 vote
371 views

Consistent Simulation of Cellular Automata on Infinite Grid

Let's say that you have an infinite grid of cells. A program is run per cell, where you have read access to some finite number of cells (for the previous state in time), but you only have write ...
• 1,320
363 views

How rule 110 would be proven to be universal if the tag system did not exist?

I was reading about Cellular Automata and I read in this question that Matthew Cook proved that rule 110 is universal, and that his proof relied upon showing how rule 110 can simulate a tag system. ...
• 143
190 views

Are Cellular Automata always computers?

I was reading on Complex Systems journal and found a paper where the author states that a cellular automaton can be viewed as a computer. In the introduction part: Cellular automata can be viewed as ...
• 171
190 views

Why some rules in Elementary Cellular Automata halt and others don't?

I was looking over stephen wolfram's work mainly about Elementary Cellular Automata, i see that for all rules with N steps {i.e 200 steps} they show the same pattern {i,e rule 90 running on 20 steps ...
• 49