Did you click through from Paul’s LW post to his blog? He gives a proof that a reversible computer can implement a PSPACE algorithm with only polynomially many erasures, and thus only polynomially much energy consumption, at the cost of running a little longer, hardly a noticeable difference compared to the exponential time required. But he also provides context which I suspect you need.
Did you click through from Paul’s LW post to his blog? He gives a proof that a reversible computer can implement a PSPACE algorithm with only polynomially many erasures, and thus only polynomially much energy consumption, at the cost of running a little longer, hardly a noticeable difference compared to the exponential time required. But he also provides context which I suspect you need.