| S. Wolfram, Undecidability and Intractability in Theoretical Physics, Phys. Rev. Lett. 54 (1985) 735. |
....of computational irreducibility. The problem of determining the configuration of a CA after t time steps, given an initial seed and the CA rule, can be solved in O(log t) time for the CAs in Figure 1. The evolution for the two other rules can only be found by explicit simulation with length O(t)[165]. The difference is that the former two are reducible and the latter two are irreducible, i.e. their ultimate behavior can only be predicted by explicit simulation. For infinite class IV CA it is effectively undecidable whether a particular rule operating on a particular initial seed will ....
....two are reducible and the latter two are irreducible, i.e. their ultimate behavior can only be predicted by explicit simulation. For infinite class IV CA it is effectively undecidable whether a particular rule operating on a particular initial seed will ultimately lead to a frozen state or not [89, 165]. Obviously this decision problem is not undecidable for finite CA, because it is always possible to determine its fate in at most k N steps, for k states and N cells. In Section 1.2.3 we will discuss the concepts of irreducibility and undecidability in more detail. Summarizing CA behavior: ....
[Article contains additional citation context not shown here]
S. Wolfram. Undecidability and intractability in theoretical physics. Phys. Rev. Let., 54:735--738, 1985. In: Cellular Automata and Complexity.
No context found.
S. Wolfram, Undecidability and Intractability in Theoretical Physics, Phys. Rev. Lett. 54 (1985) 735.
No context found.
S. Wolfram. Undecidability and intractability in theoretical physics. Phys. Rev. Lett., 55:735-- 738, 1985.
No context found.
S. Wolfram, Undecidability and intractability in theoretical physics Phys. Rev. Lett. 54:735 (1985)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC