Revision as of 21:28, 14 May 2020 edit Jaydavidmartin (talk \| contribs) Extended confirmed users 14,760 edits →Formal definition: wording clarification ← Previous edit		Revision as of 21:31, 14 May 2020 edit undo Jaydavidmartin (talk \| contribs) Extended confirmed users 14,760 edits →Description: changed "computation" to "Turing machine" and changed dash to comma Next edit →
Line 8: ==Description== A probabilistic Turing machine is a type of [[nondeterministic Turing machine]] in which each nondeterministic step is a "coin-flip"~~—that~~, that is, at each step there are two possible next moves and the ~~computation~~Turing machine probabilistically selects which move to take.<ref>{{cite book\|last=Sipser\|first=Michael\|authorlink=Michael Sipser\|title=Introduction to the Theory of Computation\|edition=2nd\|year=2006\|publisher=Thomson Course Technology\|___location=USA\|page=368\|isbn=978-0-534-95097-2\|title-link=Introduction to the Theory of Computation}}</ref> ==Formal definition==

Probabilistic Turing machine: Difference between revisions