Data-Powered Algorithms - I Bernard Chazelle Princeton University Bernard Chazelle Princeton University.

Slides:



Advertisements
Similar presentations
QMA/qpoly PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson University of Waterloo.
Advertisements

My Wild & Crazy Idea: Causal Computational Learning Theory Scott Aaronson But first: what ever happened to my WACI from a few years ago: a Web 2.0 mathematics.
Short Non-interactive Zero-Knowledge Proofs
The Future of Technology Presentation of the 2003 IEEE Fellows Technology Survey Prof. R. Struzak School on Radio Use for Information.
Wonders of the Digital Envelope
Quantum Money from Hidden Subspaces Scott Aaronson and Paul Christiano.
So Much Data Bernard Chazelle Princeton University Princeton University Bernard Chazelle Princeton University Princeton University So Little Time.
FORTRAN Short Course Week 1 Kate T-C February 17, 2008.
Welcome Each of You to My Molecular Biology Class.
CPSC 413 Fall To learn the material in CPSC 413 and get the grade I’m aiming for will require me to put significant effort into the course.
PCPs and Inapproximability Introduction. My T. Thai 2 Why Approximation Algorithms  Problems that we cannot find an optimal solution.
Kolmogorov: Complexity of an object is the shortest length of a computer program that creates the object The Human Genome, and Human Complexity Yoni Toker.
Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.
Great Theoretical Ideas in Computer Science.
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Quantum Technology Essential Question:
Digital Envelopes, Zero Knowledge, and other wonders of modern cryptography (How computational complexity enables digital security & privacy) Guy Rothblum.
Electronic Voting Schemes and Other stuff. Requirements Only eligible voters can vote (once only) No one can tell how voter voted Publish who voted (?)
Introduction to Modern Cryptography, Lecture 7/6/07 Zero Knowledge and Applications.
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
The Nature of Science What do scientists do?.
A Brief Introduction To The Theory of Computer Science and The PCP Theorem By Dana Moshkovitz Faculty of Mathematics and Computer Science The Weizmann.
Introduction to Modern Cryptography, Lecture 9 More about Digital Signatures and Identification.
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
What to do when you are done. PRINTING WITH PHOTOSHOP.
Albert Einstein 5/18. Agenda O Review biography on Albert Einstein O Discuss quotes related to Albert Einstein O To what extent can we gain natural science.
Lecture 1: Introduction CS 6903: Modern Cryptography Spring 2009 Nitesh Saxena Polytechnic Institute of NYU.
1 Unit 1: Automata Theory and Formal Languages Readings 1, 2.2, 2.3.
Section 7.1. Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning.
KCUSD Digital Citizenship “Plagiarism” Grades K-1 Images were searched through Google to be used with this lesson only.
Lesson 1. Understanding Science What is scientific inquiry? What are the results of scientific investigations? How can a scientist prevent bias in a scientific.
MA/CSSE 473 Day 10 Primality testing summary Data Encryption RSA.
Presented by: Suparita Parakarn Kinzang Wangdi Research Report Presentation Computer Network Security.
Welcome to A Brave New World Honors 222D/263D Plan for today: Whirlwind tour of a few amazing facts about computer science and a few of the topics we will.
Textbook Chapter 1 - Introduction: Exploring Life Summer Assn.
PHYSICS Mrs. Moore Room E208. A little about me…  Graduated from USC in 1993 with a B.S. in Biomedical Engineering  Worked at City of Hope Cancer Research.
Institute for Personal Robots in Education (IPRE)‏ CSC 170 Computing: Science and Creativity.
University of Massachusetts Amherst · Department of Computer Science Square Root Law for Communication with Low Probability of Detection on AWGN Channels.
A vision of the future Maewyn Cumming Assistant Director, Interoperability Office of the e-Envoy, Cabinet Office.
Quantum Computers by Ran Li.
Public Key Cryptosystems RSA Diffie-Hellman Department of Computer Engineering Sharif University of Technology 3/8/2006.
G There's an old story about the person who wished his computer were as easy to use as his telephone. That wish has come true, since I no longer know how.
A New Kind of Science by Stephen Wolfram Principle of Computational Equivalence - Ting Yan,
MT and the Future Eduard Hovy Information Sciences Institute University of Southern California.
Of 27 12/03/2015 Boole-Shannon: Laws of Communication of Thought 1 Laws of Communication of Thought? Madhu Sudan Harvard.
Zero Knowledge Proofs Matthew Pouliotte Anthony Pringle Cryptography November 22, 2005 “A proof is whatever convinces me.” -~ Shimon Even.
CSE 589 Part V One of the symptoms of an approaching nervous breakdown is the belief that one’s work is terribly important. Bertrand Russell.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 15: Intractable Problems (Smiley.
By Jay Krishnan. Introduction Information gathered from Proteomic techniques + neuroscientific research = Information on protein composition and function.
Richard W. Hamming Learning to Learn The Art of Doing Science and Engineering Session 24: Quantum Mechanics Learning to Learn The Art of Doing Science.
NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?
Introduction About The Course Design and Analysis of Algorithms I.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 23: Intractable Problems (Smiley Puzzles.
Zero-Knowledge Proofs Ben Hosp. Classical Proofs A proof is an argument for the truth or correctness of an assertion. A classical proof is an unambiguous.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Topic 36: Zero-Knowledge Proofs
DISP-2003 Dr. Hugh Blanton ENTC 4600
Probabilistic Algorithms
Who said that? Match the quote with the individual…
#DigitiseMyCareer Developing digital career literacy skills
The first Few Slides stolen from Boaz Barak
Large Scale Data Integration
KEY CONCEPT Entire genomes are sequenced, studied, and compared.
CS21 Decidability and Tractability
One Time Signature.
KEY CONCEPT Entire genomes are sequenced, studied, and compared.
KEY CONCEPT Entire genomes are sequenced, studied, and compared.
Presentation transcript:

Data-Powered Algorithms - I Bernard Chazelle Princeton University Bernard Chazelle Princeton University

Lord Kelvin ( ) “ X-rays will prove to be a hoax" “ Radio has no future. "

Albert Einstein ( 1932 ) “ There is not the slightest indication that nuclear energy will ever be obtainable. "

"I think there is a world market for maybe five computers." Thomas Watson IBM Chairman (1943 )

“Computing power doubles every two years." Gordon Moore Intel Co-founder (1965 ) Moore’s Law Moore’s Law

Moore’s Law repealed In a few decades…

“ There’s nothing to be discovered in physics today. " Lord Kelvin ( )

Lord Chazelle (2006) “ There’s nothing to be discovered in computer science today. "

Lord Chazelle (2006) “ There’s nothing to be discovered in computer science today. "

“ Computing will be the most disruptive scientific paradigm disruptive scientific paradigm since quantum mechanics." since quantum mechanics." Lord Chazelle (2006)

“ … and the end of Moore’s Law will make this even more obvious." make this even more obvious." Lord Chazelle (2006)

What is computing ?  Universality  Self-reference  Duality  Tractability

control data program

Let ‘em eat cake Print this Let ‘em eat cake

Before Turing… data

Before Turing… data

Fishing …

Fishing manual programdata

Fishing … Confucius Fishing manual programdata

needs to know how to fish

Fishing manual programdata needs to know nothing about fishing

control data program knows nothing

turn bits into sounds

display/organize

algebra Earth simulator

Let ‘em eat cake Print this Let ‘em eat cake signified signifier program data Saussure ( )

Let ‘em eat cake Print this This is not a pipe Magritte

Let ‘em eat cake Print this WHO’S ON FIRST ? Abbott and Costello

Print this

Print this twice Self-replication

James Watson – Francis Crick, 1953

Self-reference: base pairs Duality: gene/protein signifier signified

all seem intractable Protein folding Scheduling Theorem proving Traveling salesman Andrew Wiles Map coloring

equivalent Protein folding Scheduling Theorem proving Traveling salesman Andrew Wiles Map coloring

intractable ? Protein folding Theorem proving Traveling salesman Andrew Wiles Map coloring E-commerce security

Two Amazing Consequences of Intractability Zero Knowledge Probabilistically Checkable Proofs

Are you richer than me ? dunno, but I won’t tell you how much I’m worth Bill Bob

I won’t tell you either So, who’s richer ? Bill Bob

Bill There exists a dialogue… Bob

blah blah blah Bill Bob

Bill at the end of which… Bob

1. They will know who is richer 2. They will have learned nothing else ( with probability ) Bob Bill

Zero Knowledge I have no nukes ! Prove it!

1. No UN inspections 2. Both parties try to cheat

Who will believe me? My Proof of Riemann’s Hypothesis Step 1 write proof in special format Step 2 verifier picks 5 random words

compiler

Verifier There’s something wrong. I REJECT !

Verifier Everything looks fine. I ACCEPT ! Verifier is correct with probability

Verifier There’s something wrong. I REJECT ! If my 2000-page proof is wrong in only one step, how can verifier spot an error in 5 random words?

Verifier Everything looks fine. I ACCEPT ! How does verifier know I proved Riemann’s hypothesis and not 2+2=4 ?

Very little does a lot

32 x = 544 grade school

FFT signal processing

RSA encryption e-commerce

PageRank web search

Biomedical imaging Sloan Digital Sky Survey 10 petabytes (~1MG) (~1MG) 10 petabytes/yr 150 petabytes/yr 10,000 times the Library of Congress

Understanding Biological Function 100s of sequenced genomes Function of many genes unknown –30% for yeast Genome Proteome

Interaction Networks High-throughput experiments (Yeast two-hybrid, etc) Form networks of interactions

protein-protein interaction networks

Barabasi, AL. et al. (2004) Nat. Rev. Genet. Spirin, V. et al. (2003) PNAS Analysis of Interaction Networks Yeger-Lotem, E. et al. (2004) PNAS

Sciences of The Formula math, physics, chemistry

Sciences of The Algorithm Abu Abdullah Muhammad bin Musa al-Khwarizm ( )

“ If Google is a religion, what is its God? It would have to be The Algorithm. “