Reversibility and Universality

Essays Presented to Kenichi Morita on the Occasion of his 70th Birthday

Nonfiction, Computers, Advanced Computing, Artificial Intelligence, Science & Nature, Technology, Reference & Language, Reference
Cover of the book Reversibility and Universality by , Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9783319732169
Publisher: Springer International Publishing Publication: February 26, 2018
Imprint: Springer Language: English
Author:
ISBN: 9783319732169
Publisher: Springer International Publishing
Publication: February 26, 2018
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Reverse Shoulder Arthroplasty by
Cover of the book Green Adsorbents for Pollutant Removal by
Cover of the book Complications of Anorectal Surgery by
Cover of the book Quantitative Parameterization and 3D‐run‐out Modelling of Rockfalls at Steep Limestone Cliffs in the Bavarian Alps by
Cover of the book Natural Language Processing and Chinese Computing by
Cover of the book Preparing the Public Health Workforce by
Cover of the book Challenges in Mechanics of Time-Dependent Materials, Volume 2 by
Cover of the book Effective and Creative Leadership in Diverse Workforces by
Cover of the book Exploring Studbooks for Wildlife Management and Conservation by
Cover of the book Paul J. Crutzen: A Pioneer on Atmospheric Chemistry and Climate Change in the Anthropocene by
Cover of the book Foundational and Practical Aspects of Resource Analysis by
Cover of the book Technological Advances in Organ Transplantation by
Cover of the book Leibniz on Compossibility and Possible Worlds by
Cover of the book Endocannabinoids by
Cover of the book Ethical Issues in Pediatric Organ Transplantation by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy