Theory of Reversible Computing

Theory of Reversible Computing
Author :
Publisher : Springer
Total Pages : 463
Release :
ISBN-10 : 9784431566069
ISBN-13 : 4431566066
Rating : 4/5 (69 Downloads)

Book Synopsis Theory of Reversible Computing by : Kenichi Morita

Download or read book Theory of Reversible Computing written by Kenichi Morita and published by Springer. This book was released on 2017-11-06 with total page 463 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a “backward deterministic” system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general. This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems. Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model.


Theory of Reversible Computing Related Books

Theory of Reversible Computing
Language: en
Pages: 463
Authors: Kenichi Morita
Categories: Computers
Type: BOOK - Published: 2017-11-06 - Publisher: Springer

DOWNLOAD EBOOK

This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utili
Introduction to Reversible Computing
Language: en
Pages: 328
Authors: Kalyan S. Perumalla
Categories: Computers
Type: BOOK - Published: 2013-09-10 - Publisher: CRC Press

DOWNLOAD EBOOK

Few books comprehensively cover the software and programming aspects of reversible computing. Filling this gap, Introduction to Reversible Computing offers an e
Reversible Computation: Extending Horizons of Computing
Language: en
Pages: 250
Authors: Irek Ulidowski
Categories: Computers
Type: BOOK - Published: 2020-05-13 - Publisher: Springer Nature

DOWNLOAD EBOOK

This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged
Reversible Computing
Language: en
Pages: 262
Authors: Alexis De Vos
Categories: Computers
Type: BOOK - Published: 2011-08-04 - Publisher: John Wiley & Sons

DOWNLOAD EBOOK

Written by one of the few top internationally recognized experts in the field, this book concentrates on those topics that will remain fundamental, such as low
Reversible Logic Synthesis
Language: en
Pages: 448
Authors: Anas N. Al-Rabadi
Categories: Technology & Engineering
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

For the first time in book form, this comprehensive and systematic monograph presents methods for the reversible synthesis of logic functions and circuits. It i