Applications of Automata Theory and Algebra: Via the Mathematical Theory of Complexity to Biology, Physics, Psychology, Philosophy, and Games

Front Cover
World Scientific, 2010 - Mathematics - 274 pages
0 Reviews
This book was originally written in 1969 by Berkeley mathematician John Rhodes. It is the founding work in what is now called algebraic engineering, an emerging field created by using the unifying scheme of finite state machine models and their complexity to tie together many fields: finite group theory, semigroup theory, automata and sequential machine theory, finite phase space physics, metabolic and evolutionary biology, epistemology, mathematical theory of psychoanalysis, philosophy, and game theory. The author thus introduced a completely original algebraic approach to complexity and the understanding of finite systems. The unpublished manuscript, often referred to as "The Wild Book," became an underground classic, continually requested in manuscript form, and read by many leading researchers in mathematics, complex systems, artificial intelligence, and systems biology. Yet it has never been available in print until now.

This first published edition has been edited and updated by Chrystopher Nehaniv for the 21st century. Its novel and rigorous development of the mathematical theory of complexity via algebraic automata theory reveals deep and unexpected connections between algebra (semigroups) and areas of science and engineering. Co-founded by John Rhodes and Kenneth Krohn in 1962, algebraic automata theory has grown into a vibrant area of research, including the complexity of automata, and semigroups and machines from an algebraic viewpoint, and which also touches on infinite groups, and other areas of algebra. This book sets the stage for the application of algebraic automata theory to areas outside mathematics.

The material and references have been brought up to date bythe editor as much as possible, yet the book retains its distinct character and the bold yet rigorous style of the author. Included are treatments of topics such as models of time as algebra via semigroup theory; evolution-complexity relations applicable to both ontogeny and evolution; an approach to classification of biological reactions and pathways; the relationships among coordinate systems, symmetry, and conservation principles in physics; discussion of "punctuated equilibrium" (prior to Stephen Jay Gould); games; and applications to psychology, psychoanalysis, epistemology, and the purpose of life.

The approach and contents will be of interest to a variety of researchers and students in algebra as well as to the diverse, growing areas of applications of algebra in science and engineering. Moreover, many parts of the book will be intelligible to non-mathematicians, including students and experts from diverse backgrounds.


What people are saying - Write a review

We haven't found any reviews in the usual places.


Birth Death Time Space Existence Understanding Science and Religion John Rhodes
1 Introduction
2 What is Finite Group Theory?
3 A Generalization of Finite Group Theory to Finite Semigroups
4 A Reformulation of Physics
5 Automata Models and the Complexity of Finite State Machines
6 Applications

Other editions - View all

Common terms and phrases

About the author (2010)

Chrystopher L. Nehaniv is Research Professor of Mathematical and Evolutionary Computer Sciences in the School of Computer Science at the University of Hertfordshire, where he works with the Adaptive Systems, Algorithms and BioComputation Research Groups. He is the Director of the UK EPSRC Network on Evolvability in Biological and Software Systems and an Associate Editor of BioSystems: Journal of Biological and Information Processing Sciences and Interaction Studies: Social Behaviour and Communication in Biological and Artificial Systems.

Bibliographic information