Presentation is loading. Please wait.

Presentation is loading. Please wait.

Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory Theory of Computation CS3102 – Spring 2014 A tale.

Similar presentations


Presentation on theme: "Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory Theory of Computation CS3102 – Spring 2014 A tale."— Presentation transcript:

1 Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory Theory of Computation CS3102 – Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

2 Only 1 Lecture Left! We will not get to context sensitive grammars, you may skip those problems on the problem set The final exam will be take home (same rules as midterm) Out: noon Friday May 1 st Due: 5pm Friday May 8 th

3 Impagliazzo’s 5 Worlds Describes what computer science might look like depending on how certain open questions are answered. Algorithmica Heuristica Pessiland Minicrypt Cryptomania

4 Gauss vs. Büttner Büttner’s goal: embarrass Gauss Come up with a problem which Gauss finds difficult but Büttner can solve quickly For example: 1.Start with some NP problem 2.Pick a witness 3.Find a string for that witness 4.Give the string to Gauss

5 Algorithmica P=NP (or similar) NP problems solvable efficiently Gauss can quickly find the witness to Buttner’s problem Gauss is not embarrassed Advantages: VLSI Design Strong AI Cure for cancer? Disadvantages: No privacy Turing Test Passable

6 Heuristica P≠NP in worst case, P=NP on average Time to come up with a problem ≈ time to solve it Büttner can give hard problems, but it’s hard to find them Gauss is not embarrassed Advantages: Maybe similar to Algorithmica Depends on real- world distributions Disadvantages: Bad real world distributions could make things hard to solve

7 Pessiland P≠NP on average, one-way functions don’t exist Hard problems easy to find, but solved hard problems difficult to find Gauss can be stumped, but teacher does no better Advantages: Universal Compression Reverse Engineering Derandomization Disadvantages: No crypto No algorithmic advantages Progress is slow

8 Minicrypt One-way functions exist, no public key cryptography Büttner can give hard problems to Gauss and also know their solutions Gauss is embarrassed Advantages: Private key crypto Can prove identity Disadvantages: No electronic currencies

9 Cryptomania Public Key Crypto Exists Büttner can come up with problems and solutions, then share the solution with all other students Gauss is very embarrassed Advantages: Secure computation Signatures Bitcoin, etc. Disadvantages: Algorithmic progress will be slow


Download ppt "Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory Theory of Computation CS3102 – Spring 2014 A tale."

Similar presentations


Ads by Google