This paper describes the simulation of an S(n) space-bounded deterministic
Turing machine by a reversible Turing machine operating in space S(n). It t
hus answers a question posed by Bennett in 1989 and refuses the conjecture.
made by Li and Vitanyi in 1996, that any reversible simulation of an irrev
ersible computation must obey Bennett's reversible pebble game rules. (C) 2
000 Academic Press.