Rice ’ s Theorem. Def: A property of the Turing-recognizable languages is simply a subset of all Turing- recognizable languages.

Slides:

Advertisements

Similar presentations

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,

Advertisements

CS 461 – Nov. 9 Chomsky hierarchy of language classes –Review –Let’s find a language outside the TM world! –Hints: languages and TM are countable, but.

Turing -Recognizable vs. -Decidable

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.

Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.

Reducibility 2 Theorem 5.1 HALT TM is undecidable.

More Turing Machines Sipser 3.2 (pages ). CS 311 Fall Multitape Turing Machines Formally, we need only change the transition function to.

Reducibility Sipser 5.1 (pages ). CS 311 Fall Reducibility.

Reducibility Sipser 5.1 (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.

Fall 2004COMP 3351 Undecidable problems for Recursively enumerable languages continued…

Prof. Busch - LSU1 Decidable Languages. Prof. Busch - LSU2 Recall that: A language is Turing-Acceptable if there is a Turing machine that accepts Also.

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.

Costas Busch - RPI1 Undecidable problems for Recursively enumerable languages continued…

Fall 2003Costas Busch - RPI1 Decidability. Fall 2003Costas Busch - RPI2 Recall: A language is decidable (recursive), if there is a Turing machine (decider)

CS 302: Discrete Math II A Review. An alphabet Σ is a finite set (e.g., Σ = {0,1}) A string over Σ is a finite-length sequence of elements of Σ For x.

Decidability. Why study un-solvability? When a problem is algorithmically unsolvable, we realize that the problem must be simplified or altered before.

Fall 2004COMP 3351 Reducibility. Fall 2004COMP 3352 Problem is reduced to problem If we can solve problem then we can solve problem.

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

1 Decidability continued. 2 Undecidable Problems Halting Problem: Does machine halt on input ? State-entry Problem: Does machine enter state halt on input.

Automata & Formal Languages, Feodor F. Dragan, Kent State University 1 CHAPTER 5 Reducibility Contents Undecidable Problems from Language Theory.

Courtesy Costas Busch - RPI1 Reducibility. Courtesy Costas Busch - RPI2 Problem is reduced to problem If we can solve problem then we can solve problem.

Theory of Computing Lecture 20 MAS 714 Hartmut Klauck.

Fall 2006Costas Busch - RPI1 Undecidable Problems (unsolvable problems)

Prof. Busch - LSU1 Undecidable Problems (unsolvable problems)

Prof. Busch - LSU1 Reductions. Prof. Busch - LSU2 Problem is reduced to problem If we can solve problem then we can solve problem.

1 Reducibility. 2 Problem is reduced to problem If we can solve problem then we can solve problem.

INHERENT LIMITATIONS OF COMPUTER PROGRAMS CSci 4011.

Cs3102: Theory of Computation Class 18: Proving Undecidability Spring 2010 University of Virginia David Evans.

Decidability A decision problem is a problem with a YES/NO answer. We have seen decision problems for - regular languages: - context free languages: [Sections.

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.

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.

Turing -Recognizable vs. -Decidable

Lecture 21 Reducibility. Many-one reducibility For two sets A c Σ* and B c Γ*, A ≤ m B if there exists a Turing-computable function f: Σ* → Γ* such that.

Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.

Recursively Enumerable and Recursive Languages. Definition: A language is recursively enumerable if some Turing machine accepts it.

Automata, Grammars and Languages

CSCI 2670 Introduction to Theory of Computing

Busch Complexity Lectures: Reductions

Undecidable Problems Costas Busch - LSU.

Reductions Costas Busch - LSU.

Automata, Grammars and Languages

CS154, Lecture 10: Rice’s Theorem, Oracle Machines

Busch Complexity Lectures: Undecidable Problems (unsolvable problems)

CS154, Lecture 10: Rice’s Theorem, Oracle Machines

Decidability of logical theories

CSCI 2670 Introduction to Theory of Computing

Decidable Languages Costas Busch - LSU.

Functional Properties and Problem Reduction

Undecidable problems:

Computability and Complexity

CSCI 2670 Introduction to Theory of Computing

Proposed in Turing’s 1936 paper

More undecidable languages

Decidability of logical theories

Do not hand in your homework until the end of class

CSCI 2670 Introduction to Theory of Computing

More undecidable languages

Turing -Recognizable vs. -Decidable

CSCI 2670 Introduction to Theory of Computing

Automata, Grammars and Languages

More Undecidable Problems

Presentation transcript:

Rice ’ s Theorem

Def: A property of the Turing-recognizable languages is simply a subset of all Turing- recognizable languages.

A property is trivial if it is either empty or is all Turing-recognizable languages. Otherwise, it is nontrivial. Note that the empty property  is different from the property {  }.

Thm: Every nontrivial property of the Turing- recognizable languages is undecidable.

Pf: Let C be a nontrivial property. Assume , otherwise we can consider. Since C is nontrivial, there exists a non- empty language L  C.

Letbe a TM accepting (or recognizing) L. Given, construct the following TM : M w Accept Start x

Thus, if we could decide or not,then we could decide. Therefore, C is undecidable.

Eg. The following are undecidable:

Eg. How about the following: 1. 2.