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.
This research was supported by Grant N00014-75-C-0661, Office of Naval Research, funded by DARPA.