Models of Computation.

Slides:



Advertisements
Similar presentations
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Advertisements

January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
Computability and Complexity 5-1 Classifying Problems Computability and Complexity Andrei Bulatov.
CFG => PDA Sipser 2 (pages ).
CFG => PDA Sipser 2 (pages ). CS 311 Fall Formally… A pushdown automaton is a sextuple M = (Q, Σ, Γ, δ, q 0, F), where – Q is a finite set.
1 CSCI-2400 Models of Computation. 2 Computation CPU memory.
Fall 2005Costas Busch - RPI1 CSCI-2400 Models of Computation.
CS5371 Theory of Computation General Info, Scope, Textbook Assessment, …
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Computability (Chapter 2) ICS 535 Design and Implementation.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
CS 490: Automata and Language Theory Daniel Firpo Spring 2003.
CS311 Automata and Complexity Theory. Admistrative Stuff Instructor: Shahab Baqai Room # 428, Ext 4428 Lectures:Mon & Wed 1530 – 1710.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
Fall 2006Costas Busch - RPI1 CSCI-2400 Models of Computation.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
1 CSCI 2400 section 3 Models of Computation Instructor: Costas Busch.
1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.
CS355 – Theory of Computation Dr. Aidan Mooney, September 2006 National University of Ireland, Maynooth Department of Computer Science.
Introduction to the Theory of Computation
CS 390 Introduction to Theoretical Computer Science.
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
© M. Winter COSC/MATH 4P61 - Theory of Computation COSC/MATH 4P61 Theory of Computation Michael Winter –office: J323 –office hours: Mon & Fri, 10:00am-noon.
Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink.
Pushdown Automata CS 130: Theory of Computation HMU textbook, Chap 6.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
CSC312 Automata Theory Lecture # 1 Introduction.
1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL.
Complexity and Computability Theory I Lecture #11 Instructor: Rina Zviel-Girshin Lea Epstein.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Computer Theory Michael J. Watts
Models of Computation نظریه زبان ها و ماشین ها Iranai.blog.ir IRANAI.BLOG.ir _
CSCI 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Pushdown.
Silberschatz and Galvin  C Programming Language Kingdom of Saudi Arabia Ministry of Higher Education Al-Majma’ah University College of Education.
Copyright © Curt Hill Other Automata Pushdown through Turing machines.
Computation Theory Asia Mahdi. Textbooks Programs, Machines and Computation: An Introduction to the Theory of Computing - Authors: Keith Clark and Don.
Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).
CSCI 2670 Introduction to Theory of Computing September 22, 2004.
Theory of Computation. Introduction We study this course in order to answer the following questions: What are the fundamental capabilities and limitations.
Overview Part 1 - Implementation Technology and Logic Design
Overview Memory definitions Random Access Memory (RAM)
Formal Foundations-II [Theory of Automata]
Introduction to Approximation Algorithms
Overview Part 1 - Storage Elements and Analysis
Introduction to the Theory of Computation
Deterministic Finite Automata And Regular Languages.
Introduction to Randomized Algorithms and the Probabilistic Method
Context-Free Languages
CS-300 Theory of Computation 2nd Sem 2017 Lecture 1.
Introduction to the Theory of Computation
Course 1 Introduction to Formal Languages and Automata Theory (part 1)
More NP-complete Problems
Reductions.
G. Pullaiah College of Engineering and Technology
Pushdown Automata PDAs
Pushdown Automata PDAs
Pushdown Automata PDAs
PDAs Accept Context-Free Languages
Pushdown Automata PDAs
AUTOMATA THEORY VI.
Digital Components and Combinational Circuits
CSCI-2400 Models of Computation Costas Busch - RPI.
CS21 Decidability and Tractability
Pushdown automata a_introduction.htm.
CSCI-2400 Models of Computation.
Principles of Computing – UFCFA3-30-1
Lecture One: Automata Theory Amjad Ali
Presentation transcript:

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

temporary memory input CPU output Program memory compute compute

temporary memory input CPU output Program memory compute compute

temporary memory input CPU Program memory output compute compute

Automaton temporary memory Automaton input CPU output Program memory

Automaton temporary memory Automaton input output transition state

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

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

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

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

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

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

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

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