# Abstract notion for energy complexity of computational problems?

Energy is very valuable computational resource especially in mobile computing. Optimizing the energy consumed during the execution of algorithms has significant practical implications. Intuitively, It seems that such abstract energy measure has to be correlated to the time complexity, the space complexity, and the frequency of space (memory) access operations. Communications costs should be accounted for if we consider distributed computing model.

Are there abstract notions of energy (possibly analogous to the action quantity in physics) which could be useful for establishing energy-complexity classes for computational problems?

This is a follow-up to this question on SE TCS

-

Classical computations can be transformed, with only polynomial size blow-up, to reversible computations (computations which do not have operations like AND, OR which lose information). Instead, operation like $x \rightarrow x + y z$ are used, which are involutions. This transformation may require writing to an auxiliary scratch space, also polynomial sized. Reversible computations, in principle, do not require energy.
There has been some research on making low-energy computer chips using ideas from reversible computation, where reversible steps take considerably less energy than irreversible steps (although neither came anywhere close to the $kT\,\ln 2$ of Landauer's principle). I don't know whether any companies are currently considering making low-energy chips based on reversibility, though. – Peter Shor Jan 21 '11 at 2:09