Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds [chapter]

Maciej Liśkiewicz, Rüdiger Reischuk
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
more » ... languages by exploiting combinatorial properties. These results imply an innite hierarchy with respect to the number of alternations of STMs, and nonclosure properties of certain classes.
doi:10.1007/bfb0029952 fatcat:7vnbstfpxngkpooer65mvnr7ne