Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Cellular automata : a discrete view of the world (Wiley Series in Discrete Mathematics & Optimization)
Schiff J., Wiley-Interscience, 2007. 272 pp. Type: Book
Date Reviewed: Jan 30 2009

Cellular automata (CA) are very interesting computational models that have become quite well known in recent years. Mathematical and computational scientists have at least heard of Conway’s Game of Life. Quite a few researchers and aficionados pursue their interests in this area with varying degrees of seriousness. Correspondingly, of course, there has been a large body of recent literature, popular as well as scientific, describing CA and their use as models in various application domains.

This book thus takes its place within the field, joining a host of similar works. Even so, it is a useful addition to the literature, as it presents a survey that is generally broad without being too superficial, while also offering in-depth coverage that is not too hard to understand for an interested beginner.

The book contains a preface and six chapters, which in certain contexts may be read independently of one another. The first chapter, “Preliminaries,” introduces some basic concepts from automata and computation theory, such as Turing machines and logic gates, before touching on some of the basics of fractals, information theory, and entropy. The second chapter, “Dynamical Systems,” starts with recurrence relations, before moving on to chaos and strange attractors. The third chapter, “One-Dimensional Cellular Automata,” is, in a sense, where the book really begins; it presents the basic notion of a cellular automaton, related concepts such as the transition function, the neighborhood, and the radius, and then some features of some of Wolfram’s 256 elementary CA. The chapter also discusses such properties as additivity, reversibility, universal computation, and classification of CA.

The fourth chapter, “Two-Dimensional Automata,” is devoted mostly to the Game of Life, a sufficiently profound topic, and the many interesting concepts therein, such as oscillators, gliders, and Garden of Eden configurations. The fifth chapter, “Applications,” briefly touches on some of the applications of CA in areas such as biology, physics, and game theory. The final chapter, “Complexity,” contains some discussions of advanced topics, such as the origins of consciousness, starting from the classic McCulloch-Pitts neural network model and the theories of Minsky and Penrose; random Boolean networks; and multiagent systems consisting of autonomous agents, exemplified by honeybees and ant colonies.

The book is well produced and a good introduction to its subject, but it would have benefited from some more care in proofreading, for there are a number of typographical errors throughout. Likewise, though the quality of the illustrations is generally good, and the color plates (Figures C.1 to C.19) between pages 144 and 145 are quite pleasing, some of the graphics (for example, Figures 2.5 and 2.6) appear a bit fuzzy, and are not of publication quality.

Reviewer:  Shrisha Rao Review #: CR136470 (0912-1123)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Unbounded-Action Devices (F.1.1 ... )
 
 
Computations On Discrete Structures (F.2.2 ... )
 
 
General (F.2.0 )
 
 
General (F.4.0 )
 
 
General (I.6.0 )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Unbounded-Action Devices": Date
An efficient solution of the firing mob problem
Karel I., Dube S. Theoretical Computer Science 91(1): 57-69, 1991. Type: Article
Nov 1 1992
Real-time, pseudo real-time, and linear-time ITA
Karel I., Yu S. Theoretical Computer Science 47(1): 15-26, 1986. Type: Article
May 1 1988
Cellular automata machines: a new environment for modeling
Toffoli T. (ed), Margolus N., MIT Press, Cambridge, MA, 1987. Type: Book (9789780262200608)
Jan 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy