lect25

lect25 - 6.841 Advanced Complexity Theory Lecture 25...

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

View Full Document Right Arrow Icon
6.841 Advanced Complexity Theory May 11, 2009 Lecture 25 Lecturer: Madhu Sudan Scribe: Rishi Gupta Write your feedback for the course at https://sixweb.mit.edu/student/evaluate/6.841-s2009. It will help future students decide whether they should take the class. Motivation A few examples of where randomization (and derandomization) results are used: Algorithmic, for instance RP. This might be less exciting than we think though if BPP = P. Distributed Computing. A classic problem is: given n computers that are pairwise connected, each with a single bit. If all the bits are 0 they should agree that they all have 0, if they all have 1 they should agree they all have 1, otherwise they can do whatever. The communication links are arbitrarily speeds; some computers might even be asleep for an hour. We can’t solve this problem deterministically. Cryptography. Given that the inputs, outputs, and algorithm aren’t secret, randomness is essential to have any secrets at all. Game Theory. Equilibrium exists if and only if randomness exists. For instance, optimal rock-paper- scissors playing is dependent on access to random bits. Extracting Randomness Nature provides unpredictability. Physics at a small enough level is assumed to be random. However, as a practical matter, it’s hard to use this randomness to come up with unbiased, independent coins. Electrons are expensive to deal with; they don’t do things with exactly 50-50 probability, and it’s hard to do multiple independent trials on the same chip. Though intel does sell a costly randomness generating chip. So maybe we can start with a large number (say n 2 ) weakly random (biased, dependent) bits, and use those to generate n truly random bits. Von Neumann: If we start with a stream of random, independent bits, all biased with the same unknown
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/02/2010 for the course CS 6.841 taught by Professor Madhusudan during the Spring '09 term at MIT.

Page1 / 3

lect25 - 6.841 Advanced Complexity Theory Lecture 25...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online