{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

prob_algs - Probabilistic Algorithms Michael Sipser...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Probabilistic Algorithms Michael Sipser Presented by: Brian Lawnichak
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Introduction Probabilistic Algorithm uses the result of a random process “flips a coin” to decide next execution Purpose saves on calculating the actual best choice avoids introducing a bias e.g. query individuals in a large population
Background image of page 2
3 Probabilistic Turing Machine Definition 10.3 Nondeterministic Turing Machine M each nondeterministic step is a coin flip two legal next moves probability is given to each branch b of M Pr[ b ] = 2 - k where k is the number of coin flips on b
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
4 M  on input  w Probability that M accepts input w Pr[ M accepts w ] = Σ Pr[ b ] Probability that M rejects input w Pr[ M rejects w ] = 1 – Pr[ M accepts w ] What if there is a bad coin flip? is this algorithm 100% correct? errors should be accounted for
Background image of page 4
5 Error Probability  ε Allow the Turing machine an error probability ε where 0 ε < ½ M recognizes language L with error probability ε if w L implies Pr[ M accepts w ] 1 – ε
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}