In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution. As a consequence, a probabilistic Turing machine can (unlike a deterministic Turing machine) have stochastic results; that is, on a given input and instruction state machine, it may have different run times, or it may not halt at all; furthermore, it may accept an input in one execution and reject the same input in another execution. In the case of equal probabilities for the transitions, probabilistic Turing machines can be defined as deterministic Turing machines having an additional "write" instruction where the value of the write is uniformly distributed in the Turing machine's alphabet (generally, an equal likelihood of writing a "1" or a "0" on to the tape). Another common reformulation is simply a deterministic Turing machine with an added tape full of random bits called the "random tape". A quantum computer (or quantum Turing machine) is another model of computation that is inherently probabilistic.
Description A probabilistic Turing machine is a type of nondeterministic Turing machine in which each nondeterministic step is a "coin-flip", that is, at each step there are two possible next moves and the Turing machine probabilistically selects which move to take.
Formal definition A probabilistic Turing machine can be formally defined as the 7-tuple M = ( Q , Σ , Γ , q 0 , A , δ 1 , δ 2 ) {\displaystyle M=(Q,\Sigma ,\Gamma ,q_{0},A,\delta _{1},\delta _{2})} , where
Q {\displaystyle Q} is a finite set of states
Σ {\displaystyle \Sigma } is the input alphabet
Γ {\displaystyle \Gamma } is a tape alphabet, which includes the blank symbol #
q 0 ∈ Q {\displaystyle q_{0}\in Q} is the initial state
A ⊆ Q {\displaystyle A\subseteq Q} is the set of accepting (final) states
δ 1 : Q × Γ → Q × Γ × { L , R } {\displaystyle \delta _{1}:Q\times \Gamma \to Q\times \Gamma \times \{L,R\}} is the first probabilistic transition function. L {\displaystyle L} is a movement one cell to the left on the Turing machine's tape and R {\displaystyle R} is a movement one cell to the right.
δ 2 : Q × Γ → Q × Γ × { L , R } {\displaystyle \delta _{2}:Q\times \Gamma \to Q\times \Gamma \times \{L,R\}} is the second probabilistic transition function. At each step, the Turing machine probabilistically applies either the transition function δ 1 {\displaystyle \delta _{1}} or the transition function δ 2 {\displaystyle \delta _{2}} . This choice is made independently of all prior choices. In this way, the process of selecting a transition function at each step of the computation resembles a coin flip. The probabilistic selection of the transition function at each step introduces error into the Turing machine; that is, strings which the Turing machine is meant to accept may on some occasions be rejected and strings which the Turing machine is meant to reject may on some occasions be accepted. To accommodate this, a language L {\displaystyle L} is said to be recognized with error probability ϵ {\displaystyle \epsilon } by a probabilistic Turing machine M {\displaystyle M} if:
a string w {\displaystyle w} in L {\displaystyle L} implies that Pr [ M accepts w ] ≥ 1 − ϵ {\displaystyle {\text{Pr}}[M{\text{ accepts }}w]\geq 1-\epsilon }
a string w {\displaystyle w} not in L {\displaystyle L} implies that Pr [ M rejects w ] ≥ 1 − ϵ {\displaystyle {\text{Pr}}[M{\text{ rejects }}w]\geq 1-\epsilon }
Complexity classes
… excerpt ends here. Continue reading the full article.
