Theory of Reversible Computing

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 pre...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Morita, Kenichi (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Tokyo : Springer Japan : Imprint: Springer, 2017.
Σειρά:Monographs in Theoretical Computer Science. An EATCS Series,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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.