January 30, 2015.ppt

* * * January 30, 2015 CS21 Lecture 11 * Definition of reduction function f should be computable Definition: f : Σ*→ Σ* is computable if there exists a TM Mf such that on every w?Σ* Mf halts on w with f(w) written on its tape. yes no yes no A B f f January 30, 2015 CS21 Lecture 11 * Definition of reduction Notation: “A many-one reduces to B” is written A ≤m B “yes maps to yes and no maps to no” means: w ? A maps to f(w) ? B w ? A maps to f(w) ? B B is at least as “hard” as A more accurate: B at least as “expressive” as A * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * CS21 Lecture 11 January 30, 2015 CS21 Lecture 11 * CS21 Decidability and Tractability Lecture 11 January 30, 2015 January 30, 2015 CS21 Lecture 11 * Outline decidable, RE, co-RE languages the Halting Problem reductions many-one reductions January 30, 2015 CS21 Lecture 11 * non-RE languages Theorem: there exist languages that are not Recursively Enumerable. Proof outline: the set of all TMs is countable the set of all languages is uncountable the function L:{TMs} →{languages} cannot be onto January 30, 2015 CS21 Lecture 11 * non-RE languages Lemma: the set of all TMs is countable. Proof: each TM M can be described by a finite-length string M can enumerate these strings, and give the natural bijection with N January 30, 2015 CS21 Lecture 11 * non-RE languages Lemma: the set of all languages is uncountable Proof: fix an enumeration of all strings s1, s2, s3, … (for example, lexicographic order) a language L is described by its characteristic vector ?L whose ith element is 0 if si is not in L and 1 if si is in L January 30, 2015 CS21 Lecture 11 * non-RE languages suppose the set of all languages is countable list characteristic vectors of all languages according to the bijection f: n f(n) _ 1 0101010… 2 1010011… 3 1110001… 4 0100011… … January 30, 2015 CS21 Lecture 11 * non-RE languages suppose the set of all languages is countable list characteristic vect