Presented by Ravi Teja Pampana

Slides:



Advertisements
Similar presentations
Restricted Machines Presented by Muhannad Harrim.
Advertisements

The Turing Machine A definition of computability by Noah Richards.
Chapter 11: Models of Computation
Turing Machine Read/Write – Move Left/Right BB Read/Write Head State Qi.
Lecture 16 Deterministic Turing Machine (DTM) Finite Control tape head.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Turing’s Bold Claim He could design a simple computer that could solve anything that was computable. He postulated that whatever fancy new computers were.
Turing Machines.
December 8, 2009Theory of Computation Lecture 22: Turing Machines IV 1 Turing Machines Theorem 1.1: Any partial function that can be computed by a Post-
CS5371 Theory of Computation Lecture 10: Computability Theory I (Turing Machine)
Computability and Complexity 3-1 Turing Machine Computability and Complexity Andrei Bulatov.
Turing Machines CS 105: Introduction to Computer Science.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
Computers Central Processor Unit. Basic Computer System MAIN MEMORY ALUCNTL..... BUS CONTROLLER Processor I/O moduleInterconnections BUS Memory.
Design and Analysis of Algorithms
1 Turing Machines. 2 A Turing Machine Tape Read-Write head Control Unit.
AUTOMATA THEORY VIII.
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
Distributed Computing with Turing Machine. Turing machine  Turing machines are an abstract model of computation. They provide a precise, formal definition.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Models of Computation - Turing Machines Dale Roberts, Lecturer.
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.
Cs3102: Theory of Computation Class 14: Turing Machines Spring 2010 University of Virginia David Evans.
December 1, 2009Theory of Computation Lecture 21: Turing Machines II 1 Simulation of L n in T We will now construct a Post-Turing program Q that simulates.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
David Evans CS150: Computer Science University of Virginia Computer Science Lecture 36: Modeling Computing.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Cellular Automata FRES 1010 Eileen Kraemer Fall 2005.
1 Design a PDA which accepts: L= { a n b m : n ≠ m }
Complexity & Computability. Limitations of computer science  Major reasons useful calculations cannot be done:  execution time of program is too long.
Computer Theory Michael J. Watts
1 Which languages do the following TM’s accept over the alphabet Σ={a, b}? Recall: A TM M accepts a language L defined over an alphabet Σ if M halts on.
Turing Machines Lecture 26 Naveen Z Quazilbash. Overview Introduction Turing Machine Notation Turing Machine Formal Notation Transition Function Instantaneous.
1 Turing Machines and Equivalent Models Section 13.1 Turing Machines.
1 Turing Machines - Chap 8 Turing Machines Recursive and Recursively Enumerable Languages.
Lecture 16b Turing Machines Topics: Closure Properties of Context Free Languages Cocke-Younger-Kasimi Parsing Algorithm June 23, 2015 CSCE 355 Foundations.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
December 3, 2009Theory of Computation Lecture 21: Turing Machines III 1 Simulation of T in L Now the MIDDLE section of Q can be generated by replacing.
Computational Functionalism. Motivations A functionalist general purpose input-output device certainly sounds like a computer A functionalist general.
Turing Machines. The next level of Machine… PDAs improved on FSAs by adding memory. We make the memory more flexible to do more complicated tasks.
Turing Theory. Turing Machine A Turing Machine denoted by TM, is a collection of six things. –An alphabet  of input letters –A TAPE divided into a sequence.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Introduction to Computing Science and Programming I
COMPUTER ARCHITECTURE AND THE CYNAIDE COATED APPLE.
Turing Machines Finite State Machines.
COSC 3340: Introduction to Theory of Computation
Functionalism Computational Role
IS 2150 / TEL 2810 Introduction to Security
Theory of Computation Lecture 23: Turing Machines IV
Numerical Representation of Strings
Extensions and Restrictions of Turing Machines
Turing Machine
Theory of Computation Lecture 22: Turing Machines III
Turing Machines Acceptors; Enumerators
Chapter 9 TURING MACHINES.
Finite State Machines.
فصل سوم The Church-Turing Thesis
Theory of Computation Turing Machines.
The Off-Line Machine Input File read-only (once) Input string
Variations of the Turing Machine
Recall last lecture and Nondeterministic TMs
P.V.G’s College of Engineering, Nashik
Theory of Computation Lecture 21: Turing Machines II
Class 26: Modeling Computing CS150: Computer Science
Theory of Computation Lecture 22: Turing Machines II
Theory of Computation Lecture 23: Turing Machines III
332:437 Lecture 14 Turing Machines and State Machine Sequences
Presentation transcript:

Presented by Ravi Teja Pampana

Agenda What is Turing Machine How it works Examples of Turing Machine Simulation in Turing Machine and Computers

What is Turing Machine Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules It is invented by Alan Turing in the year 1936.

How it works It consists of infinitely long tape. This tape will act like a memory to store the data. This tape is divided into infinite cells, each consists of symbols. The symbols we use in this machine are 0,1 and " "(blank).

Continued…. This machine is having head which is placed on the top of the cell, this perform 3 kinds of operations Read the symbol on the cell Write the symbol on the cell Move to left or right to the next cell.

Example let's try printing the symbols "1 1 0" on an initially blank tape: First, we write a 1 on the square under the head:

Continued Next, we move the tape left by one square: Now, write a 1 on the new square under the head:

Continued We then move the tape left by one square again and write a 0 : Finally, and that's it!

Turing Machine is having some set of rules in order to perform certain operations on the tape. This rules are defined in “instruction table”.

Simulation in Turing Machine We will see, how increment operation is done in Turing Machine.

Simulation in Computers Increment operation performed in computers. #include void main() { int i = 10; i = i + 1; printf(“%d”,i); }

Simulation in Turing Machine Given input is divided by 2

Simulation in Computers Dividing given input by 2 #include void main() { int i = 8; i = i/2; printf(“%f”,i); }

Simulation in Turing Machine Given input is multiplied by 2

Simulation in Computers Given input is multiplied by 2 #include void main() { int i = 3; i = i*2; printf(“%d”, i); }

Summary Any computation that is performed on computers can be performed by the Turing Machine Internal processing of computers uses the concept of Turing machine.

Referrence als/turing-machine/one.html ence%20articles/what%20is%20a%20turing%20machi ne.html

Any queries

Thank You