1. UMass Lowell Computer Science 91.304 Foundations of Computer Science Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Th. 9/3/2009

2. Web Page http://www.cs.uml.edu/~kdaniels/courses/304.html

3. Nature of the Course Core course: required for all CS majors Core course: required for all CS majors Advanced undergraduate level Advanced undergraduate level Graduate students take separate course (91.502) Graduate students take separate course (91.502) No programming required No programming required “Pencil-and-paper” exercises “Pencil-and-paper” exercises

4. Prerequisites Growth of Functions Summations Recurrences Sets Probability MATH Proofs Logarithms Permutations Combinations Discrete Math I & II (92.321, 92.322)

5. What’s it all about? Automata and Languages Automata and Languages Starting point for models of computation Finite automaton used in text processing, compilers, hardware design. Context-free grammar used in programming languages and AI. Computability Theory Computability Theory What is an algorithm? What is computable? What is “decidable?” What is an algorithm? What is computable? What is “decidable?” Theoretical models led to actual computer construction. Theoretical models led to actual computer construction. Helps to identify useful approaches to real problems. Helps to identify useful approaches to real problems. Complexity Theory Complexity Theory Classify problems as easy or “hard” by creating complexity classes. Classify problems as easy or “hard” by creating complexity classes. Cryptography has used computationally hard problems to design codes. Cryptography has used computationally hard problems to design codes. -Three areas below are central to the theory of computation. -They are linked by the common question: -“What are the fundamental capabilities and limitations of computers?” source: textbook

6. Course Structure: 3 Parts Automata and Languages Automata and Languages Regular Languages Regular Languages Context-Free Languages Context-Free Languages Computability Theory Computability Theory Church-Turing Thesis Church-Turing Thesis Decidability Decidability Reducibility Reducibility Complexity Theory Complexity Theory Time Complexity Time Complexity

7. Textbook Required: Introduction to the Theory of ComputationIntroduction to the Theory of Computation by Michael Sipserby Michael Sipser Thomson Course TechnologyThomson Course Technology 20062006 ISBN 0-534-95097-3ISBN 0-534-95097-3 see course web site (Related Links) for errata (2 nd edition)see course web site (Related Links) for errata (2 nd edition) Ordered for UML bookstore 2 nd Edition

8. Syllabus (current plan)

9. Syllabus (current plan, continued)

11. Important Dates Quiz (closed book) Thursday, 9/10 Quiz (closed book) Thursday, 9/10 Midterm Exam : Thursday, 10/22 Midterm Exam (Chapters 0-3) : Thursday, 10/22 Final Exam (Chapters 0-5, 7): TBA Final Exam (Chapters 0-5, 7): TBA

12. Grading Homework30% Quiz ( chapter 0, closed book ) 5% Midterm ( chapters 0-3, open book & notes ) 30% Discretionary ( attendance, participation ) 5% Final Exam ( cumulative, open book & notes ) 30%