Abstract
In this paper we study Automata Networks whose local rules are “compatibles” with the Potts Hamiltonian. We prove that there exists compatible local rules with a very complex global behaviour (automata configurations may code any logic function) and that Maximal Local Rules admit a Lyapunov functional derived from the Potts Hamiltonian. Furthermore, in the last case, the steady-state behaviour is very simple: fixed points and/or two cycles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Wolfram, Theory and Applications of Cellular Automata, World Scientific, 1986.
E. Bienenstock, F. Fogelman-Soulie, G. Weisbuch, ‘Disordered Systems and Biological Organization’, NATO AST Series F. Computer and Systems Sciences, Vol.20, Springer-Verlag, 1986.
A. Burks, Esays on Cellular Automata, University of Illinois Press, 1970.
E. Goles, ‘Dynamics of Positive Automata Networks’, Theor. Comp. Sci. 41(1985) 19–32.
E. Goles, ‘Local Graph Transformations Driven by Lyapunov Functionals’, Res. Rep. Dep. Mat., U. Ch. (1988), send to Complex Systems.
E. Goles, A.M. Odlyzko, ‘Decreasing Energy Functions and Lengths of Transients for some Cellular Automata’, to appear in Complex Systems 2-(1988).
Y. Pomeau, G. Vichniac, ‘Personal Communication’.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Goles, E. (1989). Potts Model and Automata Networks. In: Tirapegui, E., Villarroel, D. (eds) Instabilities and Nonequilibrium Structures II. Mathematics and Its Applications, vol 50. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2305-8_7
Download citation
DOI: https://doi.org/10.1007/978-94-009-2305-8_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7535-0
Online ISBN: 978-94-009-2305-8
eBook Packages: Springer Book Archive