On small space complexity classes of stochastic turing machines and Arthur-Merlin-games
A Stochastic Turing machine (STM) Is a luring 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 investigate stochastic machines with space resources between constant and logarithmic size, and, in addition, constant or sublinear bounds on the number of alternations between nondeterministic and probabilistic moves. Lower space bounds are shown for a specific family of languages by exploiting combinatorial properties. These results imply an infinite hierarchy with respect to the number of alternations of STMs, and nonclosure properties of certain classes.
space complexity stochastic turing machines arthur-merlin-games interactive proof systems sublogarithmic complexity bounds complexity hierarchies