Reversibility and Universality - Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday (Hardcover, 1st ed. 2018)

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, reversible simulations of ranking trees, Shor's factorization algorithms, and power consumption of cellular automata.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Emergence, Complexity and Computation, 30
Release date:	March 2018
First published:	2018
Editors:	Andrew Adamatzky
Dimensions:	235 x 155mm (L x W)
Format:	Hardcover
Pages:	484
Edition:	1st ed. 2018
ISBN-13:	978-3-319-73215-2
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Reference & Interdisciplinary > Communication studies > Information theory > General
LSN:	3-319-73215-3
Barcode:	9783319732152

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!