1 / 17

CS-300 Theory of Computation

This is an introductory course on the theory of computation. It covers topics such as computation, memory, CPUs, automata, and the power of Turing Machines. Explore the syllabus and learn about different computational models.

aquisenberry
Download Presentation

CS-300 Theory of Computation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS-300 Theory of Computation Lecture 1

  2. General Info for the Course Instructor: Dr.Mohammad El-Bashir Syllabus: tentative class schedule can be found in course web page Book: Introduction to the Theory of Computation Michael Sipser, 3rd edition Lecture 1

  3. Outline of the course contents Computation memory CPU Lecture 1

  4. temporary memory input CPU output Program memory Lecture 1

  5. Example: temporary memory input CPU output Program memory compute compute Lecture 1

  6. temporary memory input CPU output Program memory compute compute Lecture 1

  7. temporary memory input CPU output Program memory compute compute Lecture 1

  8. temporary memory input CPU Program memory output compute compute Lecture 1

  9. Automaton temporary memory Automaton input CPU output Program memory Lecture 1

  10. Automaton temporary memory Automaton input output transition state Lecture 1

  11. Different Kinds of Automata • Automata are distinguished by the temporary memory • Finite Automata: no temporary memory • Pushdown Automata: stack • Turing Machines: random access memory Lecture 1

  12. Finite Automaton temporary memory input Finite Automaton output Example: Elevators, Vending Machines (small computing power) Lecture 1

  13. Pushdown Automaton Temp. memory Stack Push, Pop input Pushdown Automaton output Example: Compilers for Programming Languages (medium computing power) Lecture 1

  14. Turing Machine Temp. memory Random Access Memory input Turing Machine output Examples: Any Algorithm (highest computing power) Lecture 1

  15. Power of Automata Simple problems More complex problems Hardest problems Finite Automata Pushdown Automata Turing Machine Less power More power Solve more computational problems Lecture 1

  16. Turing Machine is the most powerful computational model known Question: Are there computational problems that a Turing Machine cannot solve? Answer: Yes (unsolvable problems) Lecture 1

  17. Time Complexity of Computational Problems: NP-complete problems Believed to take exponential time to be solved P problems Solved in polynomial time Lecture 1

More Related