Algorithms Sipser 3.3 (pages 154-159). CS 311 Mount Holyoke College 2 Computability Hilbert's Tenth Problem: Find “a process according to which it can.

Slides:



Advertisements
Similar presentations
Algorithms Sipser 3.3 (pages ). CS 311 Fall Computability Hilbert's Tenth Problem: Find a process according to which it can be determined.
Advertisements

Measuring Time Complexity
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Turing -Recognizable vs. -Decidable
Applied Computer Science II Chapter 3 : Turing Machines Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
Regular operations Sipser 1.2 (pages 47-63). First… a sample proof Latex files on ella.
Measuring Time Complexity Sipser 7.1 (pages )
P and NP Sipser (pages ). CS 311 Fall Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)
Regular operations Sipser 1.1 (pages 44 – 47). CS 311 Mount Holyoke College 2 Building languages If L is a language, then its complement is L’ = {w |
NP-completeness Sipser 7.4 (pages 271 – 283). CS 311 Mount Holyoke College 2 The classes P and NP NP = ∪ k NTIME(n k ) P = ∪ k TIME(n k )
Turing machines Sipser 2.3 and 3.1 (pages )
More Turing Machines Sipser 3.2 (pages ). CS 311 Fall Multitape Turing Machines Formally, we need only change the transition function to.
Turing machines Sipser 2.3 and 3.1 (pages )
Reducibility Sipser 5.1 (pages ).
Regular expressions Sipser 1.3 (pages 63-76). CS 311 Mount Holyoke College 2 Looks familiar…
CFG => PDA Sipser 2 (pages ).
The Halting Problem Sipser 4.2 (pages ). CS 311 Mount Holyoke College 2 Taking stock All languages Turing-recognizable Turing-decidable Context-free.
Intro to DFAs Readings: Sipser 1.1 (pages 31-44) With basic background from Sipser 0.
The Halting Problem Sipser 4.2 (pages ).
Mapping Reducibility Sipser 5.3 (pages ).
More Turing Machines Sipser 3.2 (pages ).
NFAs Sipser 1.2 (pages 47–54). CS 311 Mount Holyoke College 2 Recall… Last time we showed that the class of regular languages is closed under: –Complement.
Mapping Reducibility Sipser 5.3 (pages ). CS 311 Fall Computable functions Definition 5.17: A function f:Σ*→Σ* is a computable function.
Decidable languages Sipser 4.1 (pages ). CS 311 Mount Holyoke College 2 Hierarchy of languages All languages Turing-recognizable Turing-decidable.
Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Fall 2004COMP 3351 Turing Machines. Fall 2004COMP 3352 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Fall 2004COMP 3351 The Chomsky Hierarchy. Fall 2004COMP 3352 Non-recursively enumerable Recursively-enumerable Recursive Context-sensitive Context-free.
Lecture 5 Turing Machines
Courtesy Costas Busch - RPI1 Turing Machines. Courtesy Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Computation Theory Introduction to Turing Machine.
Turing Machines.
CHAPTER 3 The Church-Turing Thesis
1 Computing Functions with Turing Machines. 2 A function Domain: Result Region: has:
Foundations of (Theoretical) Computer Science
CS5371 Theory of Computation Lecture 10: Computability Theory I (Turing Machine)
Costas Busch - RPI1 Turing Machines. Costas Busch - RPI2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
Prof. Busch - LSU1 Turing Machines. Prof. Busch - LSU2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Turing Machines – Decidability Lecture 25 Section 3.1 Fri, Oct 19, 2007.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
Decidable languages Section 4.1 CSC 4170 Theory of Computation.
The Church-Turing Thesis Chapter 3 Giorgi Japaridze Theory of Computability.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 7 Undecidability cont. Jan Maluszynski, IDA, 2007
Turing -Recognizable vs. -Decidable
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 3 Church-Turing Thesis Some slides are.
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich
Theory of computing, part 4. 1Introduction 2Theoretical background Biochemistry/molecular biology 3Theoretical background computer science 4History of.
Computability Review homework. Video. Variations. Definitions. Enumerators. Hilbert's Problem. Algorithms. Summary Homework: Give formal definition of.
Recursively Enumerable and Recursive 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.
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
1 Computing Functions with Turing Machines. 2 A function Domain Result Region has:
1 Turing Machines. 2 The Language Hierarchy Regular Languages Context-Free Languages ? ?
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.
Theory of Computation Automata Theory Dr. Ayman Srour.
Recursively Enumerable and Recursive Languages. Definition: A language is recursively enumerable if some Turing machine accepts it.
CSE 105 theory of computation
Computing Functions with Turing Machines
Chapter 3 Turing Machines.
Formal Languages, Automata and Models of Computation
CSE 105 theory of computation
Instructor: Aaron Roth
Formal Definitions for Turing Machines
CSE 105 theory of computation
Presentation transcript:

Algorithms Sipser 3.3 (pages )

CS 311 Mount Holyoke College 2 Computability Hilbert's Tenth Problem: Find “a process according to which it can be determined by a finite number of operations” whether a given a polynomial p(x 1,x 2,...,x n ) has an integral root.

CS 311 Mount Holyoke College 3 Algorithms Intuitively: –An algorithm is a finite sequence of operations, each chosen from a finite set of well-defined operations, that halts in a finite time. –Sometimes also called procedures or recipes

CS 311 Mount Holyoke College 4 Church-Turing Thesis Algorithm Turing machine =

CS 311 Mount Holyoke College 5 Languages and Problems Let D = {p | p is a polynomial with an integral root} Hilbert's Tenth Problem: Determine whether D is Turing-decidable

CS 311 Mount Holyoke College 6 D = {p | p is a polynomial with an integral root} Turing-recognizable M = ”On input p, where p is a polynomial p(x 1,x 2,...,x n ). 1.Lexicographically generate integer values for (x 1,x 2,...,x n ). 2.Evaluate p as each set of values is generated. 3.If, at any point, the polynomial evaluates to 0, accept."

CS 311 Mount Holyoke College 7 Hierarchy of languages All languages Turing-recognizable Turing-decidable Context-free languages Regular languages 0n1n0n1n anbncnanbncn D 0*1*0*1*

CS 311 Mount Holyoke College 8 Describing Turing machines

CS 311 Mount Holyoke College 9 Describing Turing machines Formal: Implementation: – M = "On input string w. 1.Sweep across tape, crossing off every other 0. 2.If tape contained one 0, accept. 3.Else, if number of 0's is odd, reject. 4.Return head to left-hand end of tape. 5.Go to step 1.“ High-level: repeat until n=1 exit if n mod 2 != 0 set n = n / 2