probabilistic turing machine
/P R AA0 B AH0 B IH1 L IH1 S T IH0 K T UH0 R IH0 NG M AH0 SH IY0 N/N
- 1
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.
Translate “probabilistic turing machine” into another language
Choose a language below to open the translator with English selected as the source language.