The cellular-automata tag has no wiki summary.
0
votes
1answer
39 views
Does Conway's Game of Life have attracting cycles (or equilibria)?
Is there a sequence $\:\langle S_0,S_1,S_2,...,S_{n-1},S_n\rangle\:$ of generations for Conway's Game of Life such that
[$\hspace{.01 in}S_0 = S_n$ $\:$ and $\:$ $S_0$ has at least one live cell $\:$ ...
1
vote
2answers
76 views
Implications of the Period 43 stable reflector
Mike Playle has found the long-sought stable reflector in Life. It can recover from a reflection in 43 steps, which makes all oscillators of period 43 and above possible.
What major things have been ...
3
votes
2answers
85 views
Are axioms and rules of inference interchangeable?
There is an equivalence between cellular automata and formal systems, you can code one into the other and vice versa. But in the the cellular automata (CA) the rules of inference are fixed and are ...
1
vote
0answers
118 views
Random spreading
Given an infinite grid of squares, some marked alive (which stay alive forever,) some marked dead at any time(like Conway's game of life) and 1 alive at the beginning, there is an algorithm. It starts ...
0
votes
0answers
13 views
cellular automaton, state computation
Is there any way to compute the next state(at time t+1) of cellular automaton only based on the added extra state at time t (avoiding computation based on the state at time t and t-1 )
Thanks much in ...
4
votes
2answers
61 views
Can SAT instances be solved using cellular automata?
I'm a high school student, and I have to write a 4000-word research paper on mathematics (as part of the IB Diploma Programme). Among my potential topics were cellular automata and the Boolean ...
7
votes
0answers
97 views
What turmite runs the longest before becoming predictable?
When looking at 2D Turing machines, many of them eventually become predictable. For example, Langton's Ant, the champion 2-color 1-state turmite, develops a highway after 10,000 steps. Predictable ...
0
votes
1answer
243 views
circuit in Conway’s Game of Life
Let's assume that the bits in the Moore neighborhood are numbere as follows:
$$\begin{array}{lll}
a_4 & a_3 & a_2 & a_{11}\\
a_5 & {\large a_0} & a_1 & a_{10} \\
a_6 & ...
1
vote
1answer
88 views
Moore neighborhood on a two-dimensional Cartesian lattice
How many distinct cellular automata rules are there that use the Moore
neighborhood on a two-dimensional Cartesian lattice if we allow three bits (eight states) per site?
2
votes
1answer
70 views
2 dimensional cellular automaton for prime twins?
Is there a 'simple' 2 dimensional cellular automaton to generate all prime twins ?
With 'simple' I mean not too many states per cell and not so many rules.
Thus a universal turing machine equivalent ...
3
votes
1answer
141 views
Proving Turing Completeness by Simulating Rule 110
Something I've heard often is that Rule 110 is the `simplest' Turing-complete formalism. As a programming exercise in a language I am new to, I implemented a function that computes from an initial ...
