Reversible Computing
The theory of reversible computing is based on invertible primitives and composition rules that preserve invertibility. With these constraints, one can still satisfactorily deal with both functional and structural aspects of computing processes; at the same time, one attains a closer correspondence...
Main Author: | Toffoli, Tommaso |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148978 |
Similar Items
-
Bicontinuous Extensions of Invertible Combinatorial Functions
by: Toffoli, Tommaso
Published: (2023) -
Conservative Logic
by: Fredkin, Edward, et al.
Published: (2023) -
An Efficient Algorithm for Determine the Length of the Longest Dead Path in an "LIFO" Branch-and-bound Exploration Schema
by: Pallottino, Stefano, et al.
Published: (2023) -
The CAM-7 Multiprocessor: A Cellular Automata Machine
by: Toffoli, Tommaso, et al.
Published: (2023) -
Cellular Automata Supercomputers for Fluid Dynamics Modeling
by: Margolis, Norman, et al.
Published: (2023)