15-251 Great Theoretical Ideas in Computer Science for Some.

Slides:



Advertisements
Similar presentations
8/25/2009 Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 1 Theory of Computation Course information Overview of the area Finite Automata Sofya.
Advertisements

Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Cooking for Computer Scientists. I understand that making pancakes can be a dangerous activity and that, by doing so, I am taking a risk that I.
January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
CS 253: Algorithms Syllabus Chapter 1 Appendix A.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/4/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2005 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/25/05.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/3/02.
CS 415 Algorithm Analysis Instructor: B. (Ravi) Ravikumar
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Review Lecture Tuesday, 12/10/02.
Great Theoretical Ideas in Computer Science.
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
CS10 The Beauty and Joy of Computing Lecture #23 : Limits of Computing Thanks to the success of the Kinect, researchers all over the world believe.
1 CIS /204–Spring 2008 Recitation 13 – Last Recitation Friday, April 25, 2008.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2002 Lecture 1 (Part 1) Introduction/Overview Tuesday, 1/29/02.
Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Cooking for Computer Scientists. I understand that making pancakes can be a dangerous activity and that, by doing so, I am taking a risk that I.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Great Theoretical Ideas in Computer Science for Some.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Of 28 Probabilistically Checkable Proofs Madhu Sudan Microsoft Research June 11, 2015TIFR: Probabilistically Checkable Proofs1.
CHEMISTRY 10123/10125 Spring 2007 Instructor: Professor Tracy Hanna Phone: Office: SWR 418
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Introduction Chapter 0. Three Central Areas 1.Automata 2.Computability 3.Complexity.
CS 103 Discrete Structures Lecture 01 Introduction to the Course
What should Computer Science students learn from Mathematics? Y. C. Tay Department of Mathematics Department of Computer Science National University of.
CS 312: Algorithm Analysis Lecture #4: Primality Testing, GCD This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CS 390 Introduction to Theoretical Computer Science.
How to do a Proof Using Uno!. What does it mean to prove something? PROOF (pruf) –noun 1. evidence sufficient to establish a thing as true, or to produce.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Discrete Mathematics 이재원 School of Information Technology
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
Liability & Publicity Release In consideration for receiving permission to participate in this event, I shall indemnify, waive, release, and forever discharge.
Discrete Structures for Computing
Design and Analysis of Algorithms 4 th Semester Computer Engineering Spring 2015 Conf.dr.ing. Ioana Sora
Umans Complexity Theory Lectures Lecture 1a: Problems and Languages.
Discrete Mathematics CS 285. Lecture 12 Quick Overview The conceptual center of computer science is the ALGORITHM.
Section 1-4: Solving Inequalities Goal 1.03: Operate with algebraic expressions (polynomial, rational, complex fractions) to solve problems.
Course Review Fundamental Structures of Computer Science Margaret Reid-Miller 29 April 2004.
CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Review Lecture Tuesday, 12/11/01.
1 CSC 281 Discrete Mathematics for Computer Science Dr.Yuan Tian Syllabus.
New Material: The Four Operations 1. algorithms standard (carrying, borrowing, division alg.)‏ non-standard (European, lattice...)‏ 2. properties (ugh)‏
Discrete mathematics Kwon, Tae-kyoung
5 Lecture in math Predicates Induction Combinatorics.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Cs3102: Theory of Computation (aka cs302: Discrete Mathematics II) Spring 2010 University of Virginia David Evans.
Welcome to Patriot High School!. Mission Statement Provide a safe, challenging, and effective environment where students collaboratively discover and.
Theory of Computation. Introduction We study this course in order to answer the following questions: What are the fundamental capabilities and limitations.
MATH/COMP 340: Numerical Analysis I
Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08
Welcome to 5th Grade Advanced Math Where It All ADDS UP!
Computable Functions.
COMP 283 Discrete Structures
Big Numbers: Mathematics and Internet Commerce
CS154, Lecture 18:.
Discrete Mathematics and Its Applications
Discrete Math for CS CMPSC 360 LECTURE 44 Last time:
Richard Anderson Lecture 29 Complexity Theory
Automata and Formal Languages
Cooking for Computer Scientists.
Welcome to 5th Grade Advanced Math Where It All ADDS UP!
Discrete Mathematics in the Real World
Chapter 11: Further Topics in Algebra
COMPSCI 330 Design and Analysis of Algorithms
Discrete Mathematics and Its Applications
Lecture 23: Computability CS200: Computer Science
COMP 122 – Design and Analysis of Algorithms
Presentation transcript:

Great Theoretical Ideas in Computer Science for Some

Reminders Final: Tuesday May 5 th 8:30-11:30, DH 2210 and 2315 Review Session: Saturday May 2 nd 1:00-3:00pm in Wean 7500

List of Lectures 1.Solving Problems, Writing Proofs and Enjoying the Pain 2.Pancakes With a Problem 3.Inductive Reasoning 4.Combinatorial Games 5.Unary and Binary 6.Counting I 7.Counting II 8.Counting III 9.Primes, GCD, and Continued Fractions 10.The Math of the 1950's Dating 11.Probability I: Counting in Terms of Proportions and Expectations 12.Probability II: Random Walks 13.Number Theory 14.Cryptography and RSA 15.Algebraic Structures 16.Polynomials and Error Correction 17.Graphs I 18.Graphs II 19.Finite Automata 20.Social Networks 21.This is the Big-Oh! 22.Grade School Revisited: How to Add and Multiply 23.Cantor's Legacy: Infinity And Diagonalization 24.Turing's Legacy: The Limits of Computation 25.Godel's Legacy: What is a Proof? 26.Efficient Reductions Between Problems 27.Complexity Theory: what is the P- versus-NP Question? 28.Combating Intractability

Questions About the Course?

YOU MADE IT!

WHY???

Some of the (many) applications 1.Error correction 2.Optimization 3.Zero knowledge 4.Compression 5.Secret sharing 6.Sequencing the genome 7.Cryptography …

Baseball Scheduling How do you draw up MLB’s schedule? 30 teams 162 game schedule Many many constraints: Cincinnati is always home on Opening Day, while Boston plays at Fenway Park each Patriots Day. The Mets have potential traffic and parking concerns when the U.S. Open tennis tournament is in town. Don’t want things like: Texas Rangers have nine- game Detroit-to-Oakland-to-Minnesota road trip (with no day off) Massive scheduling problem

Use Optimization Tools Mike Trick in the Tepper school Linear and integer programming software Uses theoretical ideas: algorithms and geometry – and sophisticated implementation.

Some of the (many) applications 1.Error correction 2.Optimization 3.Zero knowledge 4.Compression 5.Secret sharing 6.Sequencing the genome …

Wouldn’t it be Great? If you could “prove” (beyond reasonable doubt) to someone that statement A is true. They become thoroughly convinced. But they don’t learn anything apart from the fact that A is true.

Example “Zero-Knowledge” Proof

Some of the (many) applications 1.Error correction 2.Optimization 3.Zero knowledge 4.Compression 5.Secret sharing 6.Sequencing the genome 7.Cryptography …

Contest First person to finish their cupcake gets 1% on the final. By participating in this competition, you agree to the following:

I understand that eating cupcakes can be a dangerous activity and that, by doing so, I am taking a risk that I may be injured. I hereby assume all the risk described above, even if Luis von Ahn, Anupam Gupta, their TAs or agents, through negligence or otherwise, otherwise be deemed liable. I hereby release, waive, discharge covenant not to sue Luis von Ahn, Anupam Gupta, their TAs or any agents, participants, sponsoring agencies, sponsors, or others associated with the event, and, if applicable, owners of premises used to conduct the cupcake eating event, from any and all liability arising out of my participation, even if the liability arises out of negligence that may not be foreseeable at this time. Please don’t choke yourself…

Thanks, and Good Luck on the Exam!