CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT 20076.1 Lecture 6 Decidability Jan Maluszynski, IDA, 2007

Slides:



Advertisements
Similar presentations
Introduction to Computability Theory
Advertisements

Lecture 3 Universal TM. Code of a DTM Consider a one-tape DTM M = (Q, Σ, Γ, δ, s). It can be encoded as follows: First, encode each state, each direction,
1 COMP 382: Reasoning about algorithms Unit 9: Undecidability [Slides adapted from Amos Israeli’s]
1 CSC3130 Formal Languages and Automata Theory Tutorial 9 Undecidable Problem KN Hung SHB 1026.
1 Introduction to Computability Theory Lecture14: Recap Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture12: Decidable Languages Prof. Amos Israeli.
Reducibility Sipser 5.1 (pages ). CS 311 Fall Reducibility.
The Halting Problem Sipser 4.2 (pages ). CS 311 Mount Holyoke College 2 Taking stock All languages Turing-recognizable Turing-decidable Context-free.
The Halting Problem Sipser 4.2 (pages ).
Mapping Reducibility Sipser 5.3 (pages ).
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.
Reducibility A reduction is a way of converting one problem into another problem in such a way that a solution to the second problem can be used to solve.
Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.
Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)
Decidability. Why study un-solvability? When a problem is algorithmically unsolvable, we realize that the problem must be simplified or altered before.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 4 Context-free grammars Jan Maluszynski, IDA, 2007
Lecture 5 Turing Machines
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 1 Introduction Jan Maluszynski, IDA, 2007
CHAPTER 4 Decidability Contents Decidable Languages
CS 310 – Fall 2006 Pacific University CS310 Decidability Section 4.1/4.2 November 10, 2006.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 8+9 Time complexity 1 Jan Maluszynski, IDA, 2007
Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture NP-Completeness Jan Maluszynski, IDA, 2007
Lecture 27UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 27.
Fall 2006Costas Busch - RPI1 Undecidable Problems (unsolvable problems)
Prof. Busch - LSU1 Undecidable Problems (unsolvable problems)
CS5371 Theory of Computation Lecture 12: Computability III (Decidable Languages relating to DFA, NFA, and CFG)
CSCI 2670 Introduction to Theory of Computing November 4, 2004.
CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.
The Halting Problem – Undecidable Languages Lecture 31 Section 4.2 Wed, Oct 31, 2007.
Computability Construct TMs. Decidability. Preview: next class: diagonalization and Halting theorem.
Decidable languages Section 4.1 CSC 4170 Theory of Computation.
CSCI 2670 Introduction to Theory of Computing October 12, 2005.
 2005 SDU Lecture13 Reducibility — A methodology for proving un- decidability.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 7 Undecidability cont. Jan Maluszynski, IDA, 2007
CS 461 – Nov. 7 Decidability concepts –Countable = can number the elements  –Uncountable = numbering scheme impossible  –A TM undecidable –Language classes.
CSCI 2670 Introduction to Theory of Computing October 13, 2005.
Recursively Enumerable and Recursive Languages
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.
Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 20 Last time Mapping reductions Computation history method Today Computation history method.
CSCI 3130: Formal languages and automata theory Andrej Bogdanov The Chinese University of Hong Kong Decidable.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Undecidable.
CSCI 2670 Introduction to Theory of Computing
Lecture12 The Halting Problem
Reductions Costas Busch - LSU.
CSE 105 theory of computation
Reducibility The Chinese University of Hong Kong Fall 2010
Intro to Theory of Computation
CSE 105 theory of computation
Busch Complexity Lectures: Undecidable Problems (unsolvable problems)
Undecidable Problems (unsolvable problems)
CSE 105 theory of computation
Decidable Languages Costas Busch - LSU.
Decidable and undecidable languages
More undecidable languages
CSCI 2670 Introduction to Theory of Computing
Theory of Computability
CSE 105 theory of computation
Theory of Computability
More undecidable languages
Intro to Theory of Computation
CSE 105 theory of computation
Automata, Grammars and Languages
Intro to Theory of Computation
Intro to Theory of Computation
CSE 105 theory of computation
CSE 105 theory of computation
Presentation transcript:

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Lecture 6 Decidability Jan Maluszynski, IDA, ida.liu.se

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Outline Lecture 6 : Decidability (Sipser 4.1 – 4.2) 1.Motivation 2.What is a problem? Problem vs. Language 3.Decidable and semi-decidable problems. 4.Examples of decidable problems 5.Undecidability: the diagonalization method 6.The halting problem is undecidable 7.More examples of undecidable problems 8.Existence of unrecognizable languages. 9.Reducibility and examples of its application

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Computational problems vs. Languages Computational problem: a function from input data to output data more generally a relation R on data Data encoded as strings Relations encoded as set of strings For a given encoding R is represented as a language Computing R => generating strings of

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Example Problems and their languages Acceptance Problem for DFA: check if a given DFA accepts a given string. Language: A DFA = { | B is aDFA that accepts w} Emptiness Problem for DFA E DFA = { | A is a DFA and L(A) is empty} Equivalence Problem for DFA EQ DFA = { | A,B are DFAs and L(A)=L(B)}

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Decidable Problems An algorithm for a Computational Problem R is a Turing Machine that recognizes/generates the language A problem R is decidable iff there exists a TM that decides. Encoding is a one-one onto function. Thus there is a correspondence between different encodings.

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Examples of Decidable Problems All problems in slide 4, e.g.: DFA Acceptance Problem: Construct a TM that on input simulates B on w If the simulation ends in accept state accept, otherwise reject Parsing problem for CFG argue why Emptiness problem for CFG argue why

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT An Undecidable Problem Given a TM M and a string w check if M accepts w A TM = { | M is a TM that accepts w} Simulation of M on w may loop! But A TM is Turing-recognizable

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT A TM is undecidable Assume the contrary: there exists a TM H that accepts if M accepts w rejects otherwise Construct TM D that runs on descriptions of TM’s: on input D runs H on input > and: accepts if M does not accept rejects if M accepts D( ) accepts if D does not accept rejects if D accepts : contradiction

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT Turing-unrecognizable languages The set of all Turing machines is countable The set of all languages over a given alphabet is not countable! There are languages not recognizable by a TM! Turing-unrecognizable languages

CS Master – Introduction to the Theory of Computation Jan Maluszynski - HT A Turing-unrecognizable language L is decidable iff both L and its complement are Turing-recognizable. Explain why! A TM = { | M is a TM that accepts w} We proved A TM is undecidable and Turing- recognizable Hence the complement of A TM is Turing- unrecognizable