A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds
[chapter]
1997
Lecture Notes in Computer Science
A Stochastic Turing machine (STM) is a Turing machine that can perform nondeterministic and probabilistic moves and alternate between both types. Such devices are also called games against nature, Arthur-Merlin games, or interactive proof systems with public coins. We give an overview on complexity classes dened by STMs with space resources between constant and logarithmic size and constant or sublinear bounds on the number of alternations. New lower space bounds are shown for a specic family
doi:10.1007/bfb0029952
fatcat:7vnbstfpxngkpooer65mvnr7ne