A cellular automaton collider is a finite state machine build of rings of onedimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings. 1.

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating ...

The authors present the construction of cellular automaton models corresponding to free quantum field theories for both fermions and bosons, demonstrate that wavelengths long compared lattice spacing one recovers standard Dirac Maxwell theories. Correspondences such as this offer a new way thinking about theories, potentially simulating them on computers.

This paper investigates the k-mixing property of a multidimensional cellular automaton. Suppose F is a cellular automaton with the local rule f defined on a d-dimensional convex hull C which is generated by an apex set C. Then F is k-mixing with respect to the uniform Bernoulli measure for all positive integer k if f is a permutation at some apex in C. An algorithm called the Mixing Algorithm i...

The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uniform configuration with the majority symbol at each site. It is not known whether a one-dimensional cellular automaton with binary alphabet can classify all Bernoulli random configurations almost surely according to t...

In this paper, we construct a family of weakly universal cellular automaton for all grids {p, 3} of the hyperbolic plane for p ≥ 13. The scheme is general for p ≥ 17 and for 13 ≤ p < 17, we give such a cellular automaton for p = 13, which is enough. Also, an important property of this family is that the set of cells of the cellular automaton which are subject to changes is actually a planar set...

A cellular automaton is a discrete dynamic system of simple construction, yet capable of exhibiting complex self-organizing behavior. A cellular automaton can be used to model differential systems by assuming that time and space are quantized, and that the dependent variable takes on a finite set of possible values. Cellular-automaton behavior falls into four distinct universality classes, anal...

We introduce a novel framework of reservoir computing. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto the initial conditions of automaton cells and nonlinear computation is performed on the input via application of a rule in the automaton for a period of time. The evolution of the automaton creates a space-time volume of the automaton state sp...