Reversible computing

<p>Reversible computing is any <a href="/facts/Model_of_computation/nJr8mHSI">model of computation</a> where every step of the <a href="/facts/Computational_process/qLsELosq">process</a> is <a href="/facts/Time-reversible/Jv4CFpSy">time-reversible</a>. This means that, given the output of a computation, it's possible to perfectly reconstruct the input. In systems that <a href="/facts/Transition_system/AABVmNzn">progress</a> <a href="/facts/Deterministic_system/oT1NvyHD">deterministically</a> from one state to another, a key requirement for reversibility is a <a href="/facts/Injective_function/5ES6tqf5">one-to-one</a> <a href="/facts/Binary_relation/r9BwGgaK">correspondence</a> between each state and its successor. Reversible computing is considered an unconventional approach to computation and is closely linked to <a href="/facts/Quantum_computing/nbbcgmvq">quantum computing</a>, where the principles of quantum mechanics inherently ensure reversibility (as long as <a href="/facts/Quantum_state/7jbxd7Dx">quantum states</a> are not measured or "<a href="/facts/Wave_function_collapse/f7KvbBHK">collapsed</a>").
</p>

Reversible computing open-in-new

Reversible computing