Bicontinuous Extensions of Invertible Combinatorial Functions
We discuss and solve the problem of constructing a diffeomorphic componentwise extension for an arbitrary invertible combinatorial function. Interpreted in physical terms, our solution constitutes a proof of the physical realizability of general computing mechanisms based on reversible primitives.
Main Author: | Toffoli, Tommaso |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148952 |
Similar Items
-
A SANS study of the interfacial curvatures and the phase behavior in bicontinuous microemulsions
by: Choi, Sung-Min, 1965-
Published: (2009) -
Reversible Computing
by: Toffoli, Tommaso
Published: (2023) -
In situ polymerization of conducting polyaniline in bicontinuous cubic phase of lyotropic liquid crystal
by: Huang, N.M., et al.
Published: (2004) -
Quantitative invertibility of random matrices : a combinatorial perspective
by: Jain, Vishesh.
Published: (2020) -
Conservative Logic
by: Fredkin, Edward, et al.
Published: (2023)