1
vote
1answer
195 views
What is the dual of a pre-injective map?
In [M. Gromov, Endomorphisms of symbolic algebraic varieties, J. Eur. Math.
Soc. (JEMS) 1 (1999), 109–197], Gromov introduces the notion of pre-injective map. Recasting this notion …
2
votes
1answer
208 views
Invariant measures for Cellular automata
An easy question that I have never been able to answer.
Suppose we have the CA on $\{ 0,1,2 \}^{\mathbb{N}}$ with local rule given by $f(x,y)=A_{x,y}$ and $A$ the $3\times 3$ matri …
3
votes
2answers
168 views
Ergodicity for a Probabilistic Cellular Automaton on a finite space
Let's consider a Probabilistic Cellular Automaton on a one dimensional lattice $S$. Each site of the lattice can have two states, $0$ and $1$. The transition probability acting on …
1
vote
1answer
94 views
Ergodicity and convergence time in Probabilistic Cellular Automata
Has the following conjecture been prooved, or has any step in the direction of its proof been done?
"ANY Probabilistic Cellular Automata converge fast on the stationary probabilit …
1
vote
1answer
238 views
Turing-Complete Cellular Automata and Sym(Z)
Does there exist a Turing complete, cellular automata with universe and alphabet $\mathbb{Z}$ such that the only allowable configurations are permutations of $\mathbb{Z}$? Formally …
1
vote
1answer
109 views
Staggered timing on 2-D random walks by multiple agents
In 2-D lattice random walks by multiple drunks who can't step onto each other, mathematically I would just say the whole cellular automaton updates "at once".
But to simulate this …
4
votes
7answers
2k views
Book recommendations on cellular automata?
I have been looking for books on cellular automata, and I really can't afford more than one book right now, so I really need to make the right choice. What would be the right book …
4
votes
2answers
419 views
Solving PDE via Cellular Automata
Is there a theory for solving PDE by using Cellular Automata ? Something which is on the line of, passing to the limit (scale) i.e., if you increase the number of grid points the s …
20
votes
3answers
1k views
Ax–Grothendieck and the Garden of Eden
It's an obvious consequence of the pigeonhole principle that any injective function over finite sets is bijective. But there are some similar results in different areas of mathemat …
2
votes
1answer
364 views
Are all quantum cellular automata invertible & representable?
A little background: As far as I know there is no standard definition of a quantum cellular automaton in the literature. Different authors use different definitions. Here I propose …
0
votes
0answers
169 views
Recurrence relation with Hadamard Product
I've been drawn to a problem that requires ascertaining the existence of fixed points in the following recurrence relation, any ideas would be much appreciated. I seek neccessary c …
7
votes
3answers
876 views
Relativistic Cellular Automata
Cellular automata provide interesting models of physics: Google Scholar gives more than 25,000 results when searching for "cellular automata" physics.
Google Scholar still gives m …
11
votes
3answers
576 views
An intuitive reason why the “Rule 30” CA is random/pseudorandom?
I'm a little bit hesitant to ask this here, so please notice the tag. My hope is that someone will have a more satisfying answer than what I've heard before...
A long time ago I …
4
votes
2answers
334 views
Algorithms for modeling asynchronicity in Asynchronous Cellular Automata
Most cellular automata are defined as being updated synchronously. I am interested in asynchronous automata, where they do not all have to update simultaneously. I am restricting …
4
votes
1answer
249 views
What’s the name of this 2D cellular automaton?
Does this 2D cellular automaton have a known name and history?
n colors (numbered 1 to n), assigned randomly at the start.
For each generation, every cell that has at least one n …

