Models of Massive Parallelism
Analysis of Cellular Automata and Neural Networks
Page
%P
11 Result(s)
within
Prof. Dr. Max Garzon
Statistical Physics and Dynamical Systems
-
Book
-
Chapter
A Bibliography of Applications
Although this volume has been chielfy concerned with analysis of various aspects of the evolution of cellular automata and generalizations, their applications have played a catalytic role in their genesis and ...
-
Chapter
Decision Problems
One of the puzzling aspects about local rules of cellular automata is that despite their behavioral complexity, they are describable by finite tables that require only finitely many symbols and can be fed as i...
-
Chapter
General Properties
Perhaps the most fundamental problem in the study of cellular automata concerns the classification of local rules according to a natural notion of equivalence related to their long-time behavior. One of the di...
-
Chapter
Asymptotic Behavior
The difficulties in classifying cellular automata and networks based on their global behavior have been explained in Chapter 8. The results tend to indicate that a complete classification is, at least in many ...
-
Chapter
Cellular Automata
In this chapter we define the fundamental concepts and establish our notation. One of the problems in surveying the literature of cellular automata is the great variety of notation and terminology that has bee...
-
Chapter
Semi-totalistic Automata
In view of how tractable linear rules turn out to be, one is encouraged to investigate similar questions for more general rules. A natural next step is to make the next state of a center cell depend, not linea...
-
Chapter
Neural and Random Boolean Networks
One of the fundamental features of cellular automata is the homogeneity of the underlying cellular space. It is natural to ask whether this is a fundamental restriction or just a convenient assumption. In orde...
-
Chapter
Classification
Cellular automata and discrete neural networks constitute very simple and general models that seem to capture the fundamental features of a variety of highly complex systems. Their study offers the possibility...
-
Chapter
Turing Computability and Complexity
Ancient documents, like the Rhind Papyrus, dating as far back as 3600 B.C. attest to the fact that men have been performing computations for thousands of years, and for very practical reasons such as farming, ...
-
Chapter
Linear Cellular Automata
In the theory of classical systems, linear concepts play a fundamental role for at least two reasons: (a) they are usually about the only ones that admit a satisfactory mathematical analysis; and (b) nonlinear...
