In Turing machines, “each instruction of a Turing machine is deterministic: Given the internal state and the symbol being scanned, the immediate next operation is wholly and uniquely determined.”(Kim 2011, p.143).
However, probabilistic automation is not deterministic. This means that
“the current internal state of the machine and the symbol it is scanning do not—do not always, at any rate—together uniquely determine what the machine will do next.” (Kim 2011, p.144).
What is being meant here by probabilistic automation in Turing Machines?
Does it mean, that there can be multiple ways a Probabilistic Automata can solve a complex problem? That one cannot determine how the automata will solve the problem, but one can only calculate the probability of the automata’s method of reaching the outcome?
Kim, J. (2011) Philosophy of mind [electronic resource] / Jaegwon Kim. 3rd ed. Boulder, CO: Boulder, CO : Westview Press.