Predicting nonlinear cellular automata quickly by decomposing them into linear ones

Physica D: Nonlinear Phenomena

Volumn 111, Issue 1-4, 1998, Pages 27-41

  Moore, Cristopher ^a  

^a SANTA FE INSTITUTE   (United States)

Author keywords

Algebraic methods; Cellular automata; Non Abelian groups; Nonlinear dynamics

Indexed keywords

EID: 0002809415     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-2789(97)80003-6     Document Type: Article

References (36)

1. 1 formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
2. D.K. Arrowsmith and R.A. Dow, Additive cellular automata with external inputs, Complex Systems 9 (1995) 399-429.
3. 1, J. Comput. System Sci. 38 (1989) 150-164.
4. M. Beaudry, P. McKenzie, P. Péladeau and D. Thérien, Circuits with monoidal gates, Proc. STAGS Lecture Notes on Computer Science (Springer, Berlin, 1993) 555-565.
5. J. Berman, A. Drisko, F. Lemieux, C. Moore and D. Thérien, Circuits and expressions with non-associative gates, Proc. 12th Ann. IEEE Conf. on Computational Complexity, to appear.
6. N. Boccara, J. Nasser and M. Roger, Phys. Rev. A 44 (1991) 866.
7. W. Burnside, Theory of Groups of Finite Order (Dover, New York, 1911).
8. O. Chein, H.O. Pflugfelder and J.D.H. Smith, Quasigroups and Loops: Theory and Applications (Heldermann Verlag, Berlin, 1990).
9. J.P. Crutchfield and J.E. Hanson, Attractor vicinity decay for a cellular automaton, Chaos 3 (2) (1993) 215-224.
10. K. Culik II, L.P. Hurd and S. Yu, Computation theoretical aspects of cellular automata, Physica D 45 (1990) 357-378.
11. S. Eilenberg and M.P. Schützenberger, On pseudovarieties, Adv. in Math. 19 (1976) 413-418.
12. K. Eloranta, Partially permutive cellular automata: Analysis via tilings subalphabets, Helsinki University of Technology Research Report A 314 (1992).
13. M. Furst, J.B. Saxe and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. System Theory 17 (1984) 13-27.
14. P. Grassberger, Phys. Rev. A 28 (1983) 3666.
15. R. Greenlaw, H.J. Hoover and W.L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory (Oxford University Press, Oxford, 1995).
16. M. Hall, The Theory of Groups (Chelsea, New York, 1976).
17. J.E. Hanson and J.P. Crutchfield, Computational mechanics of cellular automata: an example, Santa Fe Institute Working Paper 95-10-095, Proc. Int. Workshop on Lattice Dynamics, Physica D, to appear.
18. E. Jen, Exact solvability and quasiperiodicity of one-dimensional cellular automata, Non-linearity 4 (1990) 251.
19. F. Lemieux, Finite groupoids and their applications to computational complexity, Ph.D. Thesis, School of Computer Science, McGill University, Montreal (1996).
20. K. Lindgren and M.G. Nordahl, Universal computation in simple one-dimensional cellular automata, Complex Systems 4 (1990) 299-318.
21. J. Machta and R. Greenlaw, The computational complexity of generating random fractals, J. Stat. Phys. 82 (1996) 1299.
22. O. Martin, A.M. Odlyzko and S. Wolfram, Algebraic properties of cellular automata, Comm. Math. Phys. 93 (1984) 219-258.
23. C. Moore, Quasi-linear cellular automata, Santa Fe Institute Working Paper 95-09-078, Proc. Int. Workshop on Lattice Dynamics, Physica D, to appear.
24. C. Moore, Majority-vote cellular automata, Ising dynamics, and P-completeness, Santa Fe Institute Working Paper 96-08-060, J. Stat. Phys., submitted.
25. C. Moore, Non-Abelian cellular automata, Santa Fe Institute Working Paper 95-09-081.
26. C. Moore and A. Drisko, Algebraic properties of the block transformation on cellular automata, Santa Fe Institute Working Paper 95-09-080, Complex Systems, to appear.
27. C. Moore and M.G. Nordahl, Predicting lattice gases is P-complete, Santa Fe Institute Working Paper 97-04-034.
28. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
29. J. Pedersen, Cellular automata as algebraic systems, Complex Systems 6 (1992) 237-250.
30. A.A. Razborov, Lower bounds for the size of circuits of bounded depth with basis {&. ⊕}, Math. Notes Acad. Sci. USSR 41 (4) (1987) 333-338.
31. A.D. Robinson, Fast computation of additive cellular automata, Complex Systems 1 (1987) 211-216.
32. D. Rusin, personal communication.
33. R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proc. 19th ACM Symposium on the Theory of Computing (1987) 77-82.
34. M. Suzuki, Group Theory I (Springer, Berlin, 1982).
35. S. Wolfram, Statistical Mechanics of Cellular Automata, Rev. Modern Phys. 55 (1983) 601-644.
36. S. Wolfram, Cryptography with Cellular Automata, Lecture Notes in Computer Science 218 (1986) 429-432.