Automata, Universality, Computation (Emergence, Complexity and

Automata, Universality, ComputationTribute to Maurice Margenstern\nAuthor(s): Andrew Adamatzky\nFormat: Hardback\nPublisher: Springer International Publishing AG, Switzerland\nImprint: Springer International Publishing AG\nISBN-13: 9783319090382, 978-3319090382\nSynopsis\nThis 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. Thos.