Sciweavers

STACS
2005
Springer

Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods

14 years 6 months ago
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very little is known about the other neighborhoods. In this article, we prove that every one-dimensional neighborhood that is sufficient to recognize every Turing language is equivalent (in terms of real-time recognition) either to the usual neighborhood {−1, 0, 1} or to the one-way neighborhood {0, 1}.
Victor Poupet
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where STACS
Authors Victor Poupet
Comments (0)