As a consequence, a probabalistic Turing machine can (unlike a Turing Machine) have stochastic results; on a given input and instruction state machine, it may have different run times, or it may not halt at all.
A nondeterministic Turing machine is like a probablistic one, except it guesses the correct answer (if that applies) every time. It has been proposed that a quantum computer is an example of this.
External Link NIST website on probabilistic Turing machines (http://www.nist.gov/dads/HTML/probablturng)
Search Encyclopedia

Featured Article
