Revision as of 09:02, 2 April 2020 edit Jaydavidmartin (talk \| contribs) Extended confirmed users 14,760 edits m →References: fixed page numbers ← Previous edit		Revision as of 09:03, 2 April 2020 edit undo Jaydavidmartin (talk \| contribs) Extended confirmed users 14,760 edits m →Description: punctuation adjustment Next edit →
Line 7: ==Description== A probabilistic Turing machine is a type of [[nondeterministic Turing machine]] in which each nondeterministic step is a ''coin-flip''—that is, there are two possible next moves, and the computation 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