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
This paper introduces a probabilistic rebound Turing machine (PRTM), and investigates the fundamental property of the machine. We ÿrst prove a sublogarithmic lower space bound on the space complexity of this model with bounded errors for recognizing speciÿc languages. This lower bound strengthens a previous lower bound for conventional probabilistic Turing machines with bounded errors. We then show, by using our lower space bound and an idea in the proof of it, that (i) $[PRTM (o(logn))] isdoi:10.1016/s0304-3975(01)00098-6 fatcat:p55iw5ul7ralxhyjrkell644xm