Skip to main content

Part of the book series: Mathematics and Its Applications ((MAIA,volume 50))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Wolfram, Theory and Applications of Cellular Automata, World Scientific, 1986.

    MATH  Google Scholar 

  2. 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.

    Google Scholar 

  3. A. Burks, Esays on Cellular Automata, University of Illinois Press, 1970.

    Google Scholar 

  4. E. Goles, ‘Dynamics of Positive Automata Networks’, Theor. Comp. Sci. 41(1985) 19–32.

    Article  MATH  Google Scholar 

  5. E. Goles, ‘Local Graph Transformations Driven by Lyapunov Functionals’, Res. Rep. Dep. Mat., U. Ch. (1988), send to Complex Systems.

    Google Scholar 

  6. E. Goles, A.M. Odlyzko, ‘Decreasing Energy Functions and Lengths of Transients for some Cellular Automata’, to appear in Complex Systems 2-(1988).

    Google Scholar 

  7. Y. Pomeau, G. Vichniac, ‘Personal Communication’.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics