Intro to Theory of Computation

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

Lecture 16 Deterministic Turing Machine (DTM) Finite Control tape head.
Variants of Turing machines
8/25/2009 Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 1 Theory of Computation Course information Overview of the area Finite Automata Sofya.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Foundations of (Theoretical) Computer Science Chapter 3 Lecture Notes (Section 3.2: Variants of Turing Machines) David Martin With.
CS605 – The Mathematics and Theory of Computer Science Turing Machines.
More Turing Machines Sipser 3.2 (pages ). CS 311 Fall Multitape Turing Machines Formally, we need only change the transition function to.
More Turing Machines Sipser 3.2 (pages ).
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
Lecture 5 Turing Machines
Turing Machines.
CS 490: Automata and Language Theory Daniel Firpo Spring 2003.
CS5371 Theory of Computation Lecture 10: Computability Theory I (Turing Machine)
CS 310 – Fall 2006 Pacific University CS310 Variants of Turing Machines Section 3.2 November 8, 2006.
Prof. Busch - LSU1 Turing Machines. Prof. Busch - LSU2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.
AUTOMATA THEORY VIII.
INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.
Turing Machines A more powerful computation model than a PDA ?
CSCI 2670 Introduction to Theory of Computing September 28, 2005.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
Lecture 24UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 24.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 3 The Church-Turing Thesis Contents Turing Machines definitions, examples,
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 12 Mälardalen University 2007.
The Church-Turing Thesis
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
FORMAL LANGUAGES, AUTOMATA, AND COMPUTABILITY * Read chapter 4 of the book for next time * Lecture9x.ppt.
CSCI 2670 Introduction to Theory of Computing
Recursively Enumerable Languages
CSCI 2670 Introduction to Theory of Computing
ماشین های تورینگ، تشخیص پذیری و تصمیم پذیری زبان ها
Complexity and Computability Theory I
Busch Complexity Lectures: Turing Machines
COSC 3340: Introduction to Theory of Computation
Turing Machines.
CS21 Decidability and Tractability
Pumping Lemma Revisited
CS154, Lecture 7: Turing Machines.
CSCI 2670 Introduction to Theory of Computing
COSC 3340: Introduction to Theory of Computation
Turing Machines 2nd 2017 Lecture 9.
CSE 105 theory of computation
Turing Machines Acceptors; Enumerators
Intro to Theory of Computation
Intro to Theory of Computation
COSC 3340: Introduction to Theory of Computation
Summary.
Chapter 3: The CHURCH-Turing thesis
فصل سوم The Church-Turing Thesis
Intro to Theory of Computation
CSE 105 theory of computation
Intro to Theory of Computation
Decidable Languages Costas Busch - LSU.
CS21 Decidability and Tractability
CS21 Decidability and Tractability
Variations of the Turing Machine
COSC 3340: Introduction to Theory of Computation
Decidability and Tractability
CSE 105 theory of computation
Computability Catch up last lecture. Turing machines. Variations
Intro to Theory of Computation
Variants of Turing machines
Intro to Theory of Computation
Intro to Theory of Computation
CSE 105 theory of computation
Presentation transcript:

Intro to Theory of Computation LECTURE 12 Last time: Jeopardy! Today: Turing Machines Turing Machine Variants CS 464 Sofya Raskhodnikova 11/25/2018 Sofya Raskhodnikova; based on slides by Nick Hopper

TM versus PDA TM can both write to and read from the tape The head can move left and right The input does not have to be read entirely Accept and Reject take immediate effect Infinite tape on the right, stick on the left TM is deterministic (will consider NTMs later)

11#111#111111 x1#111#111111 x1#yyy#zzz111 x1#111#zzz111 xx#yyy#zzzzzz MUL = {1i#1j#1k | ij = k and i, j, k ≥ 1} 11#111#111111 x1#111#111111 x1#yyy#zzz111 x1#111#zzz111 xx#yyy#zzzzzz

LUP = {1i#x1#...#xn | n ≥ i and xi = x1} 111#101#11#101 x11#101#11#101 xx1#101#11#101 . . . . .. .. .. .. xxx#101#11#101

Formal Definition of a TM A TM is a 7-tuple P = (Q, Σ, Γ, , q0, qaccept , qreject) Q is a finite set of states Σ is the input alphabet, where   Σ Γ is the stack alphabet, where   Γ and Σ  Γ  : Q  Γ → Q  Γ  {L,R} is the transition function q0 , qaccept , qreject  Q are the start, accept and reject states 11/25/2018 Sofya Raskhodnikova; based on slides by Nick Hopper

Accepting and rejecting A TM on input sting w may either halt (enter qaccept or qreject) or never halt (loop) A TM is a decider if it halts on every input.

Language of a TM A TM recognizes a language L if it accepts all strings in L and no other strings. A language is called recognizable (or enumerable) if some TM recognizes it. A TM decides a language L if it accepts all strings in L and rejects all strings not in L. A language is called decidable (or recursive) if some TM decides it.

Recognizable vs. decidable languages A language L is recognizable (enumerable) if some TM accepts strings in L and rejects strings not in L by entering qreject or looping. A language L is decidable (recursive) if some TM rejects strings not in L by entering qreject . Recognizable languages Decidable languages 11/25/2018 Sofya Raskhodnikova; based on slides by Nick Hopper

TM variant: multitape TM FINITE STATE CONTROL  : Q  Γk → Q  Γk  {L,R,S}k

Theorem: Every Multitape Turing Machine can be transformed into a single-tape Turing Machine FINITE STATE CONTROL 1 FINITE STATE CONTROL 1 # # #

SIMULATING MULTIPLE TAPES ● ● ● ● L#100#0#1#R L#100#□#□#R L#100#0#□#R 100 qjRSS qj qi qi1 qi1□ qi1□□ qj101RSS 1. “Format” tape. 2. For each move of the k-tape TM: Scan left-to-right, finding current symbols Scan left-to-right, writing new symbols Scan left-to-right, moving each tape head. 3. If a tape head goes off right end, insert blank. If tape head goes off left end, move back right.

TMs are equivalent to… TMs are equivalent to multitape TMs (proof on the board) TMs are equivalent to nondeterministic TMs (proof on the board) TMs are equivalent to double unbounded TMs (proof on the board) TMs are equivalent to FIFO automata. (HW problem) TMs are equivalent to primitive recursive functions. TMs are equivalent to cellular automata.