Abstract
For tape constructible functions S(n)≥log n, if a language L is accepted by an S(n) tape bounded probabilistic Turing machine, then there is an S(n) tape bounded probabilistic Turing machine that accepts L, the complement of L.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have