4 citations · 5 across the 6 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.OH2013
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…
nlin.CG2013
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…
cs.OH2013★ 4 cited
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…