(computer science) A Turing machine whose governing rules specify only one possible action for any given combination of the state of the machine and symbol being read.
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.