4 citations · 5 across the 6 of their papers we have counts for
6 papers
On Wave-Based Majority Gates with Cellular Automata
Genaro J. Martinez, Andrew Adamatzky, Shigeru Ninagawa +1
We demonstrate a discrete implementation of a wave-based majority gate in a chaotic Life-like cellular automaton. The gate functions via controlling of patterns' propagation into s…
Visualization of the Computation Process of a Universal Register Machine
Shigeru Ninagawa, Genaro J. Martinez
Universal register machine, a formal model of computation, can be emulated on the array of the Game of Life, a two-dimensional cellular automaton. We perform spectral analysis on t…
Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour
Sergio J. Martinez, Ivan M. Mendoza, Genaro J. Martinez +1
Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing…
Complexity Analysis in Cyclic Tag System Emulated by Rule 110
Shigeru Ninagawa, Genaro J. Martínez
It is known that elementary cellular automaton rule 110 is capable of supporting universal computation by emulating cyclic tag system. Since the whole information necessary to perf…
Computational Universality and 1/f Noise in Elementary Cellular Automata
Shigeru Ninagawa
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two…
Solving the Parity Problem with Rule 60 in Array Size of the Power of Two
Shigeru Ninagawa
In the parity problem, a given cellular automaton has to classify any initial configuration into two classes according to its parity. Elementary cellular automaton rule 60 can solv…