Automata, Universality, Computation
This book is an intellectually stimulating excursion into mathematical machines and structures capable for a universal computation. World top experts in computer science and mathematics overview exciting and intriguing topics of logical theory of monoids, geometry of Gauss word, philosophy of mathematics in computer science, asynchronous and parallel P-systems, decidability in cellular automata, splicing systems, reversible Turing machines, information flows in two-way finite automata, prime generators in automaton arrays, Grossone and Turing machines, automaton models of atomic lattices. The book is full of visually attractive examples of mathematical machines, open problems and challenges for future research. Those interested in the advancement of a theory of computation, philosophy of mathematics, future and emergent computing paradigms, architectures and implementations will find the book vital for their research and development.
Provides accessible and lively excursions into mathematical machines geared for universal computationAdvances broadly interesting topics of universal computation, automata, and theoretical computer scienceComprised of unique chapters written by world top experts in theory of mathematical machines and computationLavishly illustrated with visually attractive examples of mathematical machines, which will appeal not only to scientists but also to artists and general public