出典:Wikipedia
出典:『Wikipedia』 (2011/02/28 17:24 UTC 版)
In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which randomly chooses between the available transitions at each point according to some probability distribution.