Muutke küpsiste eelistusi

Theory of Reversible Computing Softcover reprint of the original 1st ed. 2017 [Pehme köide]

Teised raamatud teemal:
  • Pehme köide
  • Hind: 169,14 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 198,99 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Theory of Reversible Computing Softcover reprint of the original 1st ed. 2017Suurem pilt
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9784431568322.html

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. 

Arvustused

The book under review has several advantages in representation of reversible computing. First, exposition is developed in a rigorous theoretical setting of mathematical models of algorithms and automata. Second, the book has a high-quality and clear-cut architecture when exposition goes from the lowest level of reversible logic elements through reversible functional modules and composed logic elements to the high level of reversible abstract automata. (Mark S. Burgin, zbMATH 1383.68002, 2018)

1. Introduction.-
2. Reversible Logic Elements with Memory.-
3. Classification of Reversible Logic Elements with Memory and Their Universality.-
4. Reversible Logic Gates.-
5. Reversible Turing Machines.-
6. Making Reversible Turing Machines from Reversible Primitives.-
7. Universal Reversible Turing Machines.-
8. Space-Bounded Reversible Turing Machines.-9. Other Models of Reversible Machines.-
10. Reversible Cellular Automata.-
11. One-Dimensional Universal Reversible Cellular Automata.-
12. Two-Dimensional Universal Reversible Cellular Automata.-
13. Reversible Elementary Triangular Partitioned Cellular Automata.-
14. Self-reproduction in Reversible Cellular Automata.

Kenichi Morita is a professor emeritus of Hiroshima University. He received a Ph.D. in engineering from Osaka University in 1978, and he was a professor of the Graduate School of Engineering, Hiroshima University. He is engaged in the research of automata theory, cellular automata, reversible computing, and formal language theory.