A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Time/Space Trade-Offs for Reversible Computation

1989
*
SIAM journal on computing (Print)
*

A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or in linear time and space O(ST). The former result implies in particular that reversible machines can simulate ordinary ones in quadratic space. These

doi:10.1137/0218053
fatcat:xrpwtgojprdrlgk2twhn2hpmjm