day26 - Reduction and Equivalence m-1 to edit Master...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Reduction and Equivalence m-1, 1-1, Turing Degrees
Background image of page 1

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

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Many-One Reduction Let A and B be two sets. We say A many-one reduces to B, A & m B, if there exists a total recursive function f such that We say that A is many-one equivalent to B, Sets that are many-one equivalent are in some sense equally hard or easy.
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Many-One Degrees The relationship A ] m B is an equivalence relationship (why?) If A & m B, we say A and B are of the same many-one degree (of unsolvability). Decidable problems occupy three m-1 The hierarchy of undecidable m-1 degrees is an infinite lattice (I’ll discuss in class)
Background image of page 3

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

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 44 One-One Reduction Let A and B be two sets. We say A one-one reduces to B, A & 1 B,
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 10

day26 - Reduction and Equivalence m-1 to edit Master...

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

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