P-completeness of Cellular Automaton Rule 110
نویسندگان
چکیده
We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found by showing that Rule 110 simulates deterministic Turing machines in polynomial time. As a corollary we find that the small universal Turing machines of Mathew Cook run in polynomial time, this is an exponential improvement on their previously known simulation time overhead.
منابع مشابه
Power Spectral Analysis of Elementary Cellular Automata
Spectral analysis of elementary cellular automata is performed. A power spectrum is calculated from the evolution of 88 independent rules starting from random initial configurations. As a result, it is found that rule 110 exhibits 1/f noise during the longest time steps. Rule 110 has proved to be capable of supporting universal computation. These results suggest that there is a relationship bet...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملImpartial games emulating one-dimensional cellular automata and undecidability
We study two-player take-away games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram’s rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right patterns, the rule 110 cellular automaton was recently proved Turing-complete by Matthew Cook. Hence, many questions regarding its behavior are algorithmically undecida...
متن کاملUniversality in Elementary Cellular Automata
The purpose of this paper is to prove that one of the simplest one dimensional cellular automata is computationally universal, implying that many questions concerning its behavior, such as whether a particular sequence of bits will occur, or whether the behavior will become periodic, are formally undecidable. The cellular automaton we will prove this for is known as “Rule 110” according to Wolf...
متن کاملIs the Network Turing-Complete?
Ensuring correct network behavior is hard. Previous state of the art has demonstrated that analyzing a network containing middleboxes is hard. In this paper, we show that even using only statically configured switches, and asking the simplest possible question – “Will this concrete packet reach the destination?” – can make the problem intractable. Moreover, we demonstrate that this is a fundame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006