Reversibility and Universality by Andrew Adamatzky

Reversibility and Universality by Andrew Adamatzky

This book is a tribute to Kenichi Morita’s ideas and achievements in theoretical computer science, reversibility and computationally universal mathematical machines. It offers a unique source of information on universality and reversibility in computation and is an indispensable book for computer scientists, mathematicians, physicists and engineers.

Morita is renowned for his works on two-dimensional language accepting automata, complexity of Turing machines, universality of cellular automata, regular and context-free array grammars, and undecidability. His high-impact works include findings on parallel generation and parsing of array languages by means of reversible automata, construction of a reversible automaton from Fredkin gates, solving a firing squad synchronization problem in reversible cellular automata, self-reproduction in reversible cellular spaces, universal reversible two-counter machines, solution of nondeterministic polynomial (NP) problems in hyperbolic cellular automata, reversible P-systems, a new universal reversible logic element with memory, and reversibility in asynchronous cellular automata.

Kenichi Morita’s achievements in reversibility, universality and theory of computation are celebrated in over twenty high-profile contributions from his colleagues, collaborators, students and friends. The theoretical constructs presented in this book are amazing in their diversity and depth of intellectual insight, addressing: queue automata, hyperbolic cellular automata, Abelian invertible automata, number-conserving cellular automata, Brownian circuits, chemical automata, logical gates implemented via glider collisions, computation in swarm networks, picture arrays, universal reversible counter machines, input-position-restricted models of language acceptors, descriptional complexity and persistence of cellular automata, partitioned cellular automata, firing squad synchronization algorithms, reversible asynchronous automata, reversiblesimulations of ranking trees, Shor’s factorization algorithms, and power consumption of cellular automata.

Andrew Adamatzky is a Professor in the department of Computer Science and Creative Technologies and Director of the Unconventional Computing Centre, University of the West of England. He has published extensively in theory of computation, cellular automata and mathematical machines, parallel computing, living technologies, organic electronics, and bio-inspired computing. He has authored several books, including Identification of Cellular Automata, Computing in Nonlinear Media, Reaction Diffusion Computers, Dynamics of Crowded Minds, Physarum Machines and edited over 25 collections of chapters. He is founding editor-in-chief of the Journal of Cellular Automata and Journal of Unconventional Computing and editor-in-chief of the International Journal of Parallel, Emergent and Distributed Systems, and Parallel Processing Letters.

SKU	Unavailable
ISBN 13	9783030103347
ISBN 10	303010334X
Title	Reversibility and Universality
Author	Andrew Adamatzky
Series	Emergence Complexity And Computation
Condition	Unavailable
Binding Type	Paperback
Publisher	Springer Nature Switzerland AG
Year published	2019-01-04
Number of pages	484
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.