Why can I make any deterministic computation reversible by just keeping a copy of the initial state and all inputs?
Although it’s true that keeping all inputs makes the sequence of global state transitions a bijective function, this is not what we mean by reversible computing. Remember, a reversible computation is one in which individual operations are reversible in the sense that they can be easily undone–i.e., their inverses can be easily computed. Undoing operations is necessary in order to uncompute previous states of the computation, and recover their energy. Keeping a history of all inputs does not make it easy to undo an operation – in fact, in that scenario, undoing an operation would generally require re-running the entire computation from the beginning.
Related Questions
- When a Special Education student transfers in from another state, which date do we use for the Initial eligibility date (Element K11), the one from the transfer school or the one from our school?
- Why can I make any deterministic computation reversible by just keeping a copy of the initial state and all inputs?
- Where can I obtain a copy of the State of WI building code book?
