Turing Machines.

Slides:



Advertisements
Similar presentations
Turing Machines Memory = an infinitely long tape Persistent storage A read/write tape head that can move around the tape Initially, the tape contains only.
Advertisements

CS 345: Chapter 9 Algorithmic Universality and Its Robustness
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Simulating a modern computer by a Turing machine and vice versa CS 6800 Instructor: Dr. Elise de Doncker By Shweta Gowda Saikiran Ponnam.
More Turing Machines Sipser 3.2 (pages ). CS 311 Fall Multitape Turing Machines Formally, we need only change the transition function to.
Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.
FLAC Lecture 19 Turing Machines and Real Life * Reductions Mihai Budiu March 3, 2000.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Recursively Enumerable and Recursive Languages
Fall 2004COMP 3351 Turing Machines. Fall 2004COMP 3352 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Uncountable Sets continued Theorem: Let be an infinite countable set. The powerset of is uncountable.
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Computability (Chapter 2) ICS 535 Design and Implementation.
Turing Machines.
1 Computing Functions with Turing Machines. 2 A function Domain: Result Region: has:
Computability and Complexity 3-1 Turing Machine Computability and Complexity Andrei Bulatov.
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Turing Machines CS 105: Introduction to Computer Science.
1 Turing Machines. 2 A Turing Machine Tape Read-Write head Control Unit.
AUTOMATA THEORY VIII.
Context-Free Languages Regular Languages Violates Pumping Lemma For RLs Violates Pumping Lemma For CFLs Described by CFG, PDA 0n1n0n1n 0n1n2n0n1n2n Described.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Computation Model and Complexity Class. 2 An algorithmic process that uses the result of a random draw to make an approximated decision has the ability.
Spring 2006ICOM 4036 Programming Laguages Lecture 2 1 The Nature of Computing Prof. Bienvenido Velez ICOM 4036 Lecture 2.
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
CSE 311 Foundations of Computing I Lecture 26 Computability: Turing machines, Undecidability of the Halting Problem Spring
CSE 311 Foundations of Computing I Lecture 29 Computability: Turing machines, Undecidability of the Halting Problem Autumn 2012 CSE 3111.
Computation Theory 主講人:虞台文. Content Overview The Limitation of Computing Complexities Textbooks & Grading.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
Theory of computing, part 4. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of.
In the news: A recently security study suggests that a computer worm that ran rampant several years ago is still running on many machines, including 50%
Recursively Enumerable and Recursive Languages
MARC ProgramEssential Computing for Bioinformatics 1 The Nature of Computing Prof. Bienvenido Velez ICOM 4995 Lecture 3.
1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mälardalen University.
1 Introduction to Turing Machines
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Chapter 1 An Overview of Computers and Programming Languages.
Recall last lecture and Nondeterministic TMs Ola Svensson.
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
1 Computing Functions with Turing Machines. 2 A function Domain Result Region has:
Chapter 9 Turing Machines What would happen if we change the stack in Pushdown Automata into some other storage device? Truing Machines, which maintains.
Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Recursively Enumerable and Recursive Languages.
Fall 2013 Lecture 27: Turing machines and decidability CSE 311: Foundations of Computing.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Topic 3: Automata Theory 1. OutlineOutline Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.
8. Introduction to Turing Machines
Recursively Enumerable and Recursive Languages
Pumping Lemma Revisited
Turing Machines, Busy Beavers, and Big Questions about Computing
Chapter 9 TURING MACHINES.
Jaya Krishna, M.Tech, Assistant Professor
فصل سوم The Church-Turing Thesis
CSCE 411 Design and Analysis of Algorithms
How many computers can fit into a drop of water?
Turing Machines (TM) Deterministic Turing Machine (DTM)
Theory of Computation Turing Machines.
8. Introduction to Turing Machines
Computing Functions with Turing Machines
Theory of computing, part 4
Formal Languages, Automata and Models of Computation
Recall last lecture and Nondeterministic TMs
P.V.G’s College of Engineering, Nashik
The Nature of Computing
Formal Definitions for Turing Machines
Presentation transcript:

Turing Machines

Introduction Turing machine was invented by the Mathematician Alan Turing in 1934 A machine capable of solving any problem that can be represented algorithmically The basis from which modern Computers were developed Anything a modern computer can do can be represented using a Turing machine

What is a Turing machine? It describes an algorithm It consists of a deterministic finite state machine together with an infinitely long tape They compute functions or accept a set of strings i.e. language Input received from initial tape Output is final content of tape If it doesn’t halt on inputs specified for function then no algorithm exists and function is not computable

Power of Turing Machines The basic operations of a Turing machine cannot be divided further and all other types of computing machines can be reduced to an equivalent Turing machine A Turing machine provides a formal definition of the digital computer A sequence of Turing machines may be connected together to perform more complex operations matching those of any program running on a Pentium processor

Universal Turing Machines A UTM is a Turing machine that can execute other Turing machines by simulating their behaviour A UTM using a single 1-dim tape, the instructions of the Turing machine being simulated are placed on the tape followed by the data to be processed. It behaves as an Interpreter Desktop machines are based on this principle e.g. Java applets downloaded as data but can be executed as programs

DNA Computing Modern computers use silicon chips but recently computers have been developed based on DNA. In 2002, Ehud Shapiro showed a programmable molecular device composed of enzymes and synthetic strands of DNA. This was an implementation of a Turing Machine. A ‘DNA Turing Machine’ could be used to compare ratios of molecules in the human body – detecting cancers and releasing anti-cancer drugs.

Class work Answer questions on Turing machines worksheet. Answer questions 1-10 in the A2 Computing book pages 43 and 46. Download and install Java Download and install TuringKara. Follow the ‘Learning to use TuringKara’ worksheet.

Homework Watch the ‘A Turing Machine overview’ YouTube video Answer the past paper questions: Q6 Specimen COMP3 Q8 COMP3 2010 Hand-in answers on Friday 30th March 2012

Questions