probabilistic computation
play

Probabilistic Computation Lecture 12 Flipping coins, taking chances - PowerPoint PPT Presentation

May 21, 2023 •535 likes •1.84k views

Probabilistic Computation Lecture 12 Flipping coins, taking chances PP, BPP 1 Probabilistic Computation 2 Probabilistic Computation Output depends not only on x, but also on random coin flips 2 Probabilistic Computation Output

  1. PP, BPP and RP PP = ∪ c>0 PTIME(O(n c )) BPP = ∪ c>0 BPTIME(O(n c )) RP = ∪ c>0 RTIME(O(n c )) 9

  2. PP, BPP and RP PP = ∪ c>0 PTIME(O(n c )) BPP = ∪ c>0 BPTIME(O(n c )) RP = ∪ c>0 RTIME(O(n c )) co-RP 9

  3. co-RTM 10

  4. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM 10

  5. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM 10

  6. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM 10

  7. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM Accept if pr[yes] " 1/2; reject if pr[yes] < 1/2 co-PTM 10

  8. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM Accept if pr[yes] " 1/2; reject if pr[yes] < 1/2 co-PTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 BPTM 10

  9. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM Accept if pr[yes] " 1/2; reject if pr[yes] < 1/2 co-PTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 BPTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 co-BPTM 10

  10. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM Accept if pr[yes] " 1/2; reject if pr[yes] < 1/2 co-PTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 BPTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 co-BPTM Accept if pr[yes] > 2/3; reject if pr[yes] = 0 RTM 10

  11. co-RTM Accept if pr[yes] > 0; reject if pr[yes] = 0 NTM Accept if pr[yes] = 1; reject if pr[yes] < 1 co-NTM Accept if pr[yes] > 1/2; reject if pr[yes] ! 1/2 PTM Accept if pr[yes] " 1/2; reject if pr[yes] < 1/2 co-PTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 BPTM Accept if pr[yes] > 2/3; reject if pr[yes] < 1/3 co-BPTM Accept if pr[yes] > 2/3; reject if pr[yes] = 0 RTM Accept if pr[yes] = 1; reject if pr[yes] < 1/3 co-RTM 10

  12. RP and co-RP 11

  13. RP and co-RP One sided error (“bounded error” versions of NP and co-NP) 11

  14. RP and co-RP One sided error (“bounded error” versions of NP and co-NP) RP: if yes, may still say no w/p at most 1/3 11

  15. RP and co-RP One sided error (“bounded error” versions of NP and co-NP) RP: if yes, may still say no w/p at most 1/3 i.e., if RTM says no, can be wrong 11

  16. RP and co-RP One sided error (“bounded error” versions of NP and co-NP) RP: if yes, may still say no w/p at most 1/3 i.e., if RTM says no, can be wrong co-RP: if no, may still say yes w/p at most 1/3 11

  17. RP and co-RP One sided error (“bounded error” versions of NP and co-NP) RP: if yes, may still say no w/p at most 1/3 i.e., if RTM says no, can be wrong co-RP: if no, may still say yes w/p at most 1/3 i.e., if co-RTM says yes, can be wrong 11

  18. co-BPP, co-PP 12

  19. co-BPP, co-PP BPP = co-BPP 12

  20. co-BPP, co-PP BPP = co-BPP co-BPTMs are same as BPTMs 12

  21. co-BPP, co-PP BPP = co-BPP co-BPTMs are same as BPTMs In fact PP = co-PP 12

  22. co-BPP, co-PP BPP = co-BPP co-BPTMs are same as BPTMs In fact PP = co-PP PTMs and co-PTMs differ on accepting inputs with Pr [yes]=1/2 12

  23. co-BPP, co-PP BPP = co-BPP co-BPTMs are same as BPTMs In fact PP = co-PP PTMs and co-PTMs differ on accepting inputs with Pr [yes]=1/2 But can modify a PTM so that Pr[M(x)=yes] # 1/2 for all x, without changing language accepted 12

  24. PP = co-PP 13

  25. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 13

  26. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε 13

  27. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε 13

  28. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε M 13

  29. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε M 13

  30. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε pr[M’(x)=yes] = pr[M(x)=yes]/2 + (1/2 - ε )/2 M 13

  31. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε pr[M’(x)=yes] = pr[M(x)=yes]/2 + (1/2 - ε )/2 If pr[M(x)=yes] > 1/2 ⇒ pr[M(x)=yes] > 1/2 + ε M then M and M’ equivalent 13

  32. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε pr[M’(x)=yes] = pr[M(x)=yes]/2 + (1/2 - ε )/2 If pr[M(x)=yes] > 1/2 ⇒ pr[M(x)=yes] > 1/2 + ε M then M and M’ equivalent What is such an ε ? 13

  33. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε pr[M’(x)=yes] = pr[M(x)=yes]/2 + (1/2 - ε )/2 If pr[M(x)=yes] > 1/2 ⇒ pr[M(x)=yes] > 1/2 + ε M then M and M’ equivalent What is such an ε ? 2 -(m+1) where no. of coins used by M is at most m 13

  34. PP = co-PP Modifying a PTM M to an equivalent PTM M’, so that for all x Pr[M’(x)=yes] # 1/2 Consider M’(x): w.p. 1/2 run M(x); w.p. 1/2, ignore input and say yes w.p. 1/2 - ε , and say no w.p. 1/2 + ε pr[M’(x)=yes] = pr[M(x)=yes]/2 + (1/2 - ε )/2 If pr[M(x)=yes] > 1/2 ⇒ pr[M(x)=yes] > 1/2 + ε M then M and M’ equivalent What is such an ε ? 2 -(m+1) where no. of coins used by M is at most m M’ tosses at most m+2 coins 13

  35. PP and NP 14

  36. PP and NP NP ⊆ PP 14

  37. PP and NP NP ⊆ PP Use random-tape as non- deterministic choices of NTM M 14

  38. PP and NP NP ⊆ PP Use random-tape as non- deterministic choices of NTM M 14

  39. PP and NP NP ⊆ PP Use random-tape as non- deterministic choices of NTM M If M rejects, accept with 1/2 prob., else accept 14

  40. PP and NP NP ⊆ PP Use random-tape as non- deterministic choices of NTM M If M rejects, accept with 1/2 prob., else accept 14

  41. PP and NP NP ⊆ PP Use random-tape as non- deterministic choices of NTM M If M rejects, accept with 1/2 prob., else accept If even one thread of M(x) accepts, pr[M(x)=yes] > 1/2 14

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Probabilistic Computation Lecture 13 Understanding BPP 1 Recap 2 Recap Probabilistic

Probabilistic Computation Lecture 13 Understanding BPP 1 Recap 2 Recap Probabilistic

Probabilistic Computation Lecture 13 Understanding BPP 1 Recap 2 Recap Probabilistic computation 2 Recap Probabilistic computation NTM (on random certificates) for L: 2 Recap Probabilistic computation NTM (on random

1.12k views • 94 slides
Probabilistic Computation CSC5802, Computational Complexity Derek Kern December 11 th , 2010

Probabilistic Computation CSC5802, Computational Complexity Derek Kern December 11 th , 2010

Probabilistic Computation CSC5802, Computational Complexity Derek Kern December 11 th , 2010 What will we be doing? We will be exploring the field of probabilistic computation We'll see: Examples Turing machines Deterministic

761 views • 35 slides
Randomized Computation Eugene Santos looked at computability for Probabilistic TM. John Gill

Randomized Computation Eugene Santos looked at computability for Probabilistic TM. John Gill

Randomized Computation Eugene Santos looked at computability for Probabilistic TM. John Gill studied complexity classes defined by Probabilistic TM. 1. Eugene Santos. Probabilistic Turing Machines and Computability. Proc. American Mathematical

1.25k views • 110 slides
Probabilistic Computation Lecture 13 BPP vs. PH 1 Recap 2 Recap Probabilistic computation 2

Probabilistic Computation Lecture 13 BPP vs. PH 1 Recap 2 Recap Probabilistic computation 2

Probabilistic Computation Lecture 13 BPP vs. PH 1 Recap 2 Recap Probabilistic computation 2 Recap Probabilistic computation NTM (on random certificates) for L: 2 Recap Probabilistic computation NTM (on random certificates)

1.43k views • 95 slides
Probabilistic Numerics Uncertainty in Computation Philipp Hennig ParisBD 9 May 2017 Research

Probabilistic Numerics Uncertainty in Computation Philipp Hennig ParisBD 9 May 2017 Research

Probabilistic Numerics Uncertainty in Computation Philipp Hennig ParisBD 9 May 2017 Research Group for Probabilistic Numerics Max Planck Institute for Intelligent Systems Tbingen, Germany Some of the presented work was supported by the

676 views • 48 slides
Computation in generalised probabilistic theories Ciar an Lee Joint work with Jon Barrett

Computation in generalised probabilistic theories Ciar an Lee Joint work with Jon Barrett

Computation in generalised probabilistic theories Ciar an Lee Joint work with Jon Barrett arXiv:1412 . 8671 Motivation Quantum theory offers dramatic new advantages for various information theoretic tasks What broad relationships

711 views • 60 slides
On Higher-Order Probabilistic Computation: Relational Reasoning, Termination, and Bayesian

On Higher-Order Probabilistic Computation: Relational Reasoning, Termination, and Bayesian

On Higher-Order Probabilistic Computation: Relational Reasoning, Termination, and Bayesian Programming Ugo Dal Lago (Based on joint work with Michele Alberti, Raphalle Crubill, Charles Grellois, Davide Sangiorgi,. . . ) IFIP WG 2.2 Annual

2.46k views • 189 slides
On Zone-Based Reachability Computation for Duration-Probabilistic Automata How the Timed

On Zone-Based Reachability Computation for Duration-Probabilistic Automata How the Timed

On Zone-Based Reachability Computation for Duration-Probabilistic Automata How the Timed Automaton Lost its Tail Oded Maler CNRS - VERIMAG Grenoble, France 2010 Joint work with Kim Larsen (Aalborg) and Bruce Krogh (CMU) Summary Processes

521 views • 23 slides
The Probabilistic Method The Probabilistic Method Topics on Randomized Computation Topics on

The Probabilistic Method The Probabilistic Method Topics on Randomized Computation Topics on

The Probabilistic Method The Probabilistic Method Topics on Randomized Computation Topics on Randomized Computation Spring Semester Spring Semester Co.Re.Lab. N.T.U.A. N.T.U.A. Co.Re.Lab. Overview Overview In the first part we will

402 views • 38 slides
Descriptive complexity of real computation and probabilistic independence logic Miika Hannula,

Descriptive complexity of real computation and probabilistic independence logic Miika Hannula,

Descriptive complexity of real computation and probabilistic independence logic Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 811 July 2020 Logics

696 views • 46 slides
Lecture 16: Randomized Computation Arijit Bishnu 22.04.2010 Introduction Probabilistic Turing

Lecture 16: Randomized Computation Arijit Bishnu 22.04.2010 Introduction Probabilistic Turing

Introduction Probabilistic Turing Machine and the class BPP One-Sided and Zero-Sided Error Error Reduction for BPP Relation Lecture 16: Randomized Computation Arijit Bishnu 22.04.2010 Introduction Probabilistic Turing Machine and the class BPP

867 views • 48 slides
Probabilistic Computation Lecture 15 Computing with Less Randomness, or with Imperfect

Probabilistic Computation Lecture 15 Computing with Less Randomness, or with Imperfect

Probabilistic Computation Lecture 15 Computing with Less Randomness, or with Imperfect Randomness 1 Soundness Amplification for BPP 2 Soundness Amplification for BPP Repeat M(x) t times and take majority 2 Soundness Amplification for

1.78k views • 125 slides
Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic

Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic

Table of Contents I Probabilistic Reasoning Classical Probabilistic Models Basic Probabilistic Reasoning: The Jungle Story Multiple Random Selection Rules: Dice New Constructs Causal Probability Observations and Intentions Dynamic Range

1.08k views • 73 slides
Hierarchical Probabilistic Models for Object Segmentation S. M. Ali Eslami Christopher K. I.

Hierarchical Probabilistic Models for Object Segmentation S. M. Ali Eslami Christopher K. I.

Hierarchical Probabilistic Models for Object Segmentation S. M. Ali Eslami Christopher K. I. Williams Institute for Adaptive and Neural Computation School of Informatics The University of Edinburgh August 8, 2010 Classification Localisation

764 views • 51 slides
KLS conjecture and volume computation Alexander Tarasov Saint-Petersburg State University May

KLS conjecture and volume computation Alexander Tarasov Saint-Petersburg State University May

KLS conjecture and volume computation Alexander Tarasov Saint-Petersburg State University May 19, 2019 1 / 37 Table of content KLS conjecture Origins form TCS Computation of volume is complex Probabilistic approach to the volume

732 views • 37 slides
CS 4110 Probabilistic Programming Probabilistic Programming It's not about writing software.

CS 4110 Probabilistic Programming Probabilistic Programming It's not about writing software.

CS 4110 Probabilistic Programming Probabilistic Programming It's not about writing software. Probabilistic Programming Probabilistic programming is a tool for statistical modeling. OR A probabilistic programming language is a plain old

688 views • 41 slides
Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey,

Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey,

Parametric Polymorphism and Abstract Models of Storage (In memory of Christopher Strachey, 1916-1975) Uday S. Reddy 1 1 University of Birmingham Strachey-100, Oxford My introduction to Stracheys ideas Section 1 Introducing the terms

530 views • 40 slides
Deal Activity - - 2006 2006 7,000 $80,000 Deal Activity $70,000 6,000 $60,000 5,000

Deal Activity - - 2006 2006 7,000 $80,000 Deal Activity $70,000 6,000 $60,000 5,000

2007 Multifamily Market: Review and Assessment Aubrey L. Layne, Jr. President Great Atlantic Management GREAT ATLANTIC Deal Activity and Headlines Economic and Operating Environment Outlook HR Apartment Deal Volume and Price

540 views • 4 slides
Universality Issues in Reversible Computing Systems and Cellular Automata Kenichi Morita

Universality Issues in Reversible Computing Systems and Cellular Automata Kenichi Morita

Universality Issues in Reversible Computing Systems and Cellular Automata Kenichi Morita Hiroshima University Contents 1. Introduction 2. Reversible Turing machines (RTMs) 3. Reversible logic elements and circuits 4. Reversible cellular

1.57k views • 111 slides
Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016

Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016

Executability Hierarchy of RTMs with Infinite Alphabets Bas Luttik Fei Yang November 17, 2016 Where innovation starts Outline 2/25 Finite Version of the Theory of Executability Infinitary Reactive Turing Machines RTM with Atoms

2.77k views • 52 slides
Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J.

Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J.

Accurate and Stable Empirical CPU Power Modelling for Multi- and Many-Core Systems Matthew J. Walker*, Stephan Diestelhorst, Geoff V. Merrett* and Bashir M. Al-Hashimi* *University of Southampton Arm Ltd. Motivation: Run-Time Management

553 views • 23 slides
Lambda terms and maps, formally (II) Catherine Dubois 1 and Alain Giorgetti 2 1 Samovar, ENSIIE,

Lambda terms and maps, formally (II) Catherine Dubois 1 and Alain Giorgetti 2 1 Samovar, ENSIIE,

Lambda terms and maps, formally (II) Catherine Dubois 1 and Alain Giorgetti 2 1 Samovar, ENSIIE, Evry, France 2 FEMTO-ST, Univ. Bourgogne Franche-Comt e, Besan con, France Computational Logic and Applications Paris, 24-25 May 2018 Dubois

1.31k views • 104 slides
Ruby Topic Maps http://rtm.rubyforge.org Benjamin Bock 1 Third International Conference on

Ruby Topic Maps http://rtm.rubyforge.org Benjamin Bock 1 Third International Conference on

Getting started with Ruby Topic Maps http://rtm.rubyforge.org Benjamin Bock 1 Third International Conference on Topic Maps Research and Applications 2007-10-12 Schedule Ruby, Rails and RTM Real Source Code Scalability and

598 views • 22 slides
Wave e Ima maging ing Tec echnology hnology Inc nc. Talk Summary (45 min) WIT: Wave

Wave e Ima maging ing Tec echnology hnology Inc nc. Talk Summary (45 min) WIT: Wave

Applications of wave imaging technologies to improve onshore US prospecting Morgan Brown Pacific Coast Section SEG Luncheon September 22, 2010 Wave e Ima maging ing Tec echnology hnology Inc nc. Talk Summary (45 min) WIT: Wave

799 views • 42 slides

More recommend