[Question] Does reversible computation let you compute the complexity class PSPACE as efficiently as normal computers compute the complexity class P?

Specifically, I am asking whether reversible computers let you implement PSPACE-complete algorithms to solve PSPACE-complete problems, and in particular, do so efficiently, ideally as efficient as normal computers compute the complexity class P.

I’m interested in this question because I’ve seen some sources saying that reversible computation can implement PSPACE algorithms while conventional computers can only implement algorithms in the complexity class P.

The sources I have are these:


and this Chegg source, which claims that reversible Turing Machines with a polynomial bound on space is equal to PSPACE.


I’d like any answer to this question, but ideally an answer would either show that reversible computation is able to implement PSPACE-complete algorithms as efficiently as normal computers implement algorithms in the P complexity class, or show that reversible computation can’t do this, and show what complexity class can reversible computation efficiently implement algorithms.