We a good story
Quick delivery in the UK

Automata and Complexity

About Automata and Complexity

This book commemorates Eric Goles¿s achievements in science and engineering. Eric Goles is one of the world leaders in the field of automata and complexity. His groundbreaking discoveries are in the theory and analysis of complex systems, particularly in the field of discrete systems dynamics such as neural networks, automata networks, majority networks, bootstrap percolation models, cellular automata, computational complexity theory, discrete mathematics, and theoretical computer science. Topics include cellular automata, complex networks, models of computation, expansive systems, sandpile automata, Penrose tilings, Boolean automata, models of infection, Fibonacci trees, dominos, reversible automata, and fungal automata. The chapters are authored by world leaders in computer science, physics, mathematics, and engineering. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computer scientists, and engineers to chemists and biologists.

Show more
  • Language:
  • English
  • ISBN:
  • 9783030925536
  • Binding:
  • Paperback
  • Pages:
  • 496
  • Published:
  • April 19, 2023
  • Edition:
  • 23001
  • Dimensions:
  • 155x27x235 mm.
  • Weight:
  • 744 g.
Delivery: 2-4 weeks
Expected delivery: January 26, 2025
Extended return policy to January 30, 2025
  •  

    Cannot be delivered before Christmas.
    Buy now and print a gift certificate

Description of Automata and Complexity

This book commemorates Eric Goles¿s achievements in science and engineering. Eric Goles is one of the world leaders in the field of automata and complexity. His groundbreaking discoveries are in the theory and analysis of complex systems, particularly in the field of discrete systems dynamics such as neural networks, automata networks, majority networks, bootstrap percolation models, cellular automata, computational complexity theory, discrete mathematics, and theoretical computer science. Topics include cellular automata, complex networks, models of computation, expansive systems, sandpile automata, Penrose tilings, Boolean automata, models of infection, Fibonacci trees, dominos, reversible automata, and fungal automata. The chapters are authored by world leaders in computer science, physics, mathematics, and engineering. The book will be a pleasure to explore for readers from all walks of life, from undergraduate students to university professors, from mathematicians, computer scientists, and engineers to chemists and biologists.

User ratings of Automata and Complexity



Find similar books
The book Automata and Complexity can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.