Basics of Computation Theory. What is "abstraction"? Abstraction unifies multiple and different objects into one concept  describes the common properties.

Slides:



Advertisements
Similar presentations
Introduction to Turing Machines
Advertisements

CS 345: Chapter 9 Algorithmic Universality and Its Robustness
Lecture 16 Deterministic Turing Machine (DTM) Finite Control tape head.
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Computability and Complexity 4-1 Existence of Undecidable Problems Computability and Complexity Andrei Bulatov.
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
State Diagram. What is State Diagram?  State diagram is used to show the state space of a given class, the events that cause a transition from one state.
Turing Machines from “On Computable Numbers” Jerry Grochowski – CS 4800.
Fall 2006Costas Busch - RPI1 CSCI-2400 Models of Computation.
Turing Machines CS 105: Introduction to Computer Science.
Class 19: Undecidability in Theory and Practice David Evans cs302: Theory of Computation University of Virginia Computer.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
Theory of Computation. Computation Computation is a general term for any type of information processing that can be represented as an algorithm precisely.
Lecture 10 Topics: Sequential circuits Basic concepts Clocks
UNIVERSAL TURING MACHINES. OUTLINE Review Algorithm Why.
Presented by Ravi Teja Pampana
AUTOMATA THEORY VIII.
Finite State Machines – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Graphs and Finite State Machines Reading: Kolman, Sections.
Copyright © Cengage Learning. All rights reserved.
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
CSE202: Introduction to Formal Languages and Automata Theory Chapter 9 The Turing Machine These class notes are based on material from our textbook, An.
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
Halting Problem Introduction to Computing Science and Programming I.
Finite State Machines. What is "abstraction"? Abstraction unifies multiple and different objects into one concept  describes the common properties of.
Cs3102: Theory of Computation Class 14: Turing Machines Spring 2010 University of Virginia David Evans.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
Turing Machines and the Halting Problem This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. To.
©Brooks/Cole, 2003 Chapter 17 Theory of Computation.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
Finite State Machines CS147 : Presentation by Mabel Thong (9/25/07)
Digital System Design using VHDL
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.
Introduction to Automata Theory Theory of Computation Lecture 5 Tasneem Ghnaimat.
Theory of Computation Automata Theory Dr. Ayman Srour.
Introduction to Automata Theory Theory of Computation Lecture 3 Tasneem Ghnaimat.
Finite Automata.
CSE202: Introduction to Formal Languages and Automata Theory
Introduction to Computing Science and Programming I
Requirements Techniques, cont.
Formal Foundations-II [Theory of Automata]
8. Introduction to Turing Machines
1.3 Finite State Machines.
Finite State Machines Dr K R Bond 2009
Turing Machines Finite State Machines.
CS-300 Theory of Computation 2nd Sem 2017 Lecture 1.
CIS Automata and Formal Languages – Pei Wang
Class 30: Models of Computation CS200: Computer Science
PROGRAMMING LANGUAGES
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
Extensions and Restrictions of Turing Machines
Modeling Computation:
Finite State Machines Computer theory covers several types of abstract machines, including Finite State Machines.
Finite State Machines.
Chapter 3: The CHURCH-Turing thesis
By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman
THEORY OF COMPUTATION Lecture One: Automata Theory Automata Theory.
Theory of Computation Turing Machines.
8. Introduction to Turing Machines
Principles of Computing – UFCFA3-30-1
The Off-Line Machine Input File read-only (once) Input string
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
P.V.G’s College of Engineering, Nashik
Chapter 17 Theory of Computation.
Lecture One: Automata Theory Amjad Ali
332:437 Lecture 14 Turing Machines and State Machine Sequences
Presentation transcript:

Basics of Computation Theory

What is "abstraction"? Abstraction unifies multiple and different objects into one concept  describes the common properties of those objects common properties that are exclusive to those objects. Examples:  Vehicle is an abstraction of car, truck, motorcycle  Bird is an abstraction of duck, chicken, dove, eagle etc.  Emotion is an abstraction of anger, love, fear, sadness etc. Abstraction is an essential process in science  It helps identify commonalities and differences  It helps focus on important properties  a model is an abstraction.

Finite State Machines (automata) A Finite State Machine is an abstraction of a computing system that consists of  States of the system  Events (or triggers) that happen to the system  Actions performed by the system  Transitions between states A FSM is usually depicted by its state transition diagram.  Also, by the state transition table. State (another) state S1: Sitting S2: Standing S3: Walking E1: hear "go" Stand and walk, S3 walk, S3S3 E2: hear "stop" (no action), S1 sit, S1 Stop walking, S2

Finite State Machines: Examples A traffic light A soda dispenser A gum ball machine An elevator An ATM

Abstraction of a computing machine Finite State Machines cannot abstract all computers or all that they can do There is another model of a computer that can solve any problem that any other computer can  Alan Turing's Universal Computing Machine Known as "Universal Turing Machine" or "Turing machine"

Universal Turing Machine UTM consists of  A tape of discrete positions The tape is readable and writable Each position contains one symbol from a set of symbols  A head that reads and writes on the tape  A control unit that controls the tape and the head, and consists of A finite state machine, where:  Every event is about reading a certain symbol  Every action is about writing a symbol and moving forward or backward along the tape

UTM and the basic model of computing Computer: Universal Turing Machine Input: The tape before processing Program: The control unit's FSM specification Output: The tape after processing Computer Input Program Output