Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
A cellular automaton is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modelling. It consists of a regular grid of cells, each in one of a finite number of states, such as On or Off . The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighbourhood (usually including the cell itself) is defined relative to the specified cell. This book presents current research from across the globe in the study of cellular automata, including using cellular automata to solve optimisation problems; modelling drug release science using cellular automata; using the cellular automata model to study the dispersion of aphids and ladybugs in a block of citric trees; and the reversibility of cellular automata.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
A cellular automaton is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modelling. It consists of a regular grid of cells, each in one of a finite number of states, such as On or Off . The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighbourhood (usually including the cell itself) is defined relative to the specified cell. This book presents current research from across the globe in the study of cellular automata, including using cellular automata to solve optimisation problems; modelling drug release science using cellular automata; using the cellular automata model to study the dispersion of aphids and ladybugs in a block of citric trees; and the reversibility of cellular automata.