1. Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation

2. Fall 2005Costas Busch - RPI2 Syllabus: tentative class schedule can be found in course web page http://www.cs.rpi.edu/~buschc/courses/modcomp/fall2005 Grading: Weekly Homeworks: 34% 3 Exams: 66% (each 22%) Instructor: Costas Busch General Info for the Course

3. Fall 2005Costas Busch - RPI3 Book: Introduction to the Theory of Computation Michael Sipser, 2 nd edition Chapters that will be covered: 1-5,7

4. Fall 2005Costas Busch - RPI4 Computation CPU memory Outline of the course contents

5. Fall 2005Costas Busch - RPI5 CPU input output Program memory temporary memory

6. Fall 2005Costas Busch - RPI6 CPU input output Program memory temporary memory compute Example:

7. Fall 2005Costas Busch - RPI7 CPU input output Program memory temporary memory compute

8. Fall 2005Costas Busch - RPI8 CPU input output Program memory temporary memory compute

9. Fall 2005Costas Busch - RPI9 CPU input output Program memory temporary memory compute

10. Fall 2005Costas Busch - RPI10 Automaton CPU input output Program memory temporary memory Automaton

11. Fall 2005Costas Busch - RPI11 Automaton input output temporary memory Automaton state transition

12. Fall 2005Costas Busch - RPI12 Different Kinds of Automata Automata are distinguished by the temporary memory Finite Automata: no temporary memory Pushdown Automata: stack Turing Machines: random access memory

13. Fall 2005Costas Busch - RPI13 input output temporary memory Finite Automaton Example: Vending Machines (small computing power)

14. Fall 2005Costas Busch - RPI14 input output Stack Pushdown Automaton Pushdown Automaton Example: Compilers for Programming Languages (medium computing power) Push, Pop Temp. memory

15. Fall 2005Costas Busch - RPI15 input output Random Access Memory Turing Machine Turing Machine Examples: Any Algorithm (highest computing power) Temp. memory

16. Fall 2005Costas Busch - RPI16 Finite Automata Pushdown Automata Turing Machine Power of Automata Less powerMore power Solve more computational problems Simple problems More complex problems Hardest problems

17. Fall 2005Costas Busch - RPI17 Turing Machine is the most powerful computational model known Question: Are there computational problems that a Turing Machine cannot solve? Answer: Yes(unsolvable problems)

18. Fall 2005Costas Busch - RPI18 Time Complexity of Computational Problems: NP-complete problems P problems Believed to take exponential time to be solved Solved in polynomial time