On Compatibility of Discrete Relations
- 628 Downloads
An approach to compatibility analysis of systems of discrete relations is proposed. Unlike the Gröbner basis technique, the proposed scheme is not based on the polynomial ring structure. It uses more primitive set-theoretic and topological concepts and constructions. We illustrate the approach by application to some two-state cellular automata. In the two-state case the Gröbner basis method is also applicable, and we compare both approaches.
KeywordsCellular Automaton Simplicial Complex Local Rule Canonical Decomposition Sierpinski Gasket
Unable to display preview. Download preview PDF.
- 1.Toffoli, T.: Occam, Turing, von Neumann, Jaynes: How much can you get for how little (A conceptual introduction to cellular automata). In: Automi Cellulari per la Ricerca e l’Industria, Rende (CS), Italy, September 29–30 (1994)Google Scholar
- 3.Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Math. and its Appl, vol. 20. Cambridge University Press, London (1997)Google Scholar
- 4.’t Hooft, G.: Dimensional Reduction in Quantum Gravity, Essay dedicated to Abdus Salam, Utrecht preprint THU-93/26, p. 13; id., arXiv: gr-qc/9310026Google Scholar
- 5.Bousso, R.: The Holographic Principle. Rev. Mod. Phys. 74, 825–874 (2002), arXiv: hep-th/0203101Google Scholar