Theory of Reversible Computing
β Kenichi Morita
π Library
π
2017
π Apress
π English
β¦ LIBER β¦
π
Theory of reversible computing
β Scribed by Henzinger, Monika; HromkoviΔ, Juraj; Morita, Ken'ichi; Nielsen, Mogens
- Publisher
- Springer
- Year
- 2017
- Tongue
- English
- Leaves
- 463
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Table of Contents
Content: 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.
π SIMILAR VOLUMES
Theory of Reversible Computing
β Kenichi Morita (auth.)
π Library
π
2017
π Springer Japan
π English
<p><p>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 o
Reverse Mathematics: Problems, Reduction
β Damir D. Dzhafarov, Carl Mummert
π Library
π
2022
π Springer
π English
<p><span>Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability
Reverse Mathematics: Problems, Reduction
β Damir D. Dzhafarov, Carl Mummert
π Library
π
2022
π Springer
π English
<p><span>Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability
Reversible and DNA Computing
β Hafiz M. D. Hasan Babu
π Library
π English
Introduction to Reversible Computing
β Perumalla, Kalyan S.
π Library
π
2013
π CRC Press
π English
Few books comprehensively cover the software and programming aspects of reversible computing. Filling this gap, **Introduction to Reversible Computing** offers an expanded view of the field that includes the traditional energy-motivated hardware viewpoint as well as the emerging application-motivate