November 3

November 3 - CSCI 2670 Introduction to Theory of Computing Nove be 3 2005 mr Agenda ste Ye rday ductions(S ction 5.3 e Re Today ductions Moreon re

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing November 3, 2005
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
November 3, 2005 Agenda Yesterday Reductions (Section 5.3) Today More on reductions Section 6.3 We will not be covering section 6.4 I will discuss some basic issues of this section when covering chapter 7
Background image of page 2
November 3, 2005 Announcement Remember to let me know if you want to come to my pizza party next Wednesday
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
November 3, 2005 Mapping reducibility Definition: Language A is mapping reducible to language B, written A m B, if there is a computable function f: * * , where for every w, w A iff f(w) B f f
Background image of page 4
November 3, 2005 Why m ? In some sense, if A m B, then A is “less powerful” than B For example, we can map from CFG’s to decidable languages that aren’t CF, but not vice versa Example We can easily map any CFG C to A CFG f(w) = <C,w> w C iff <C,w> A CFG You can use this example to help you remember how to use reductions
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
November 3, 2005 Theorem: If A m B and B is decidable, then A is decidable. Proof: Let M be a decider for B and let f be a reduction from A to B. Consider the following TM, N: N = “On input w: 1. Compute f(w) 2. Run M on f(w) and report M’s output Then N decides A
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 21

November 3 - CSCI 2670 Introduction to Theory of Computing Nove be 3 2005 mr Agenda ste Ye rday ductions(S ction 5.3 e Re Today ductions Moreon re

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online