1 / 17

Models of Computation

Models of Computation. Outline of the course contents. Computation. memory. CPU. temporary memory. input. CPU. output. Program memory. Example:. temporary memory. input. CPU. output. Program memory. compute. compute. temporary memory. input. CPU. output. Program memory.

lynnem
Download Presentation

Models 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. Models of Computation

  2. Outline of the course contents Computation memory CPU

  3. temporary memory input CPU output Program memory

  4. Example: temporary memory input CPU output Program memory compute compute

  5. temporary memory input CPU output Program memory compute compute

  6. temporary memory input CPU output Program memory compute compute

  7. temporary memory input CPU Program memory output compute compute

  8. Automaton temporary memory Automaton input CPU output Program memory

  9. Automaton temporary memory Automaton input output transition state

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

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

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

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

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

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

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

  17. This Summary is an Online Content from this Book:Michael Sipser, Introduction to the Theory of Computation, 2ndEditionIt is edited forComputation Theory Course 6803415-3 by:T.Mariah Sami KhayatTeacher Assistant @ Adam University CollegeFor Contacting:mskhayat@uqu.edu.sa Kingdom of Saudi Arabia Ministry of Education Umm AlQura University Adam University College Computer Science Department المملكة العربية السعودية وزارة التعليم جامعة أم القرى الكلية الجامعية أضم قسم الحاسب الآلي

More Related