This preview shows page 1. Sign up to view the full content.
Unformatted text preview: S 1 and S 2 ( S 1 ∩ S 2 = Ø, S 1 ∪ S 2 = S ) such that the sum of elements in S 1 equals the sum of elements in S 2 f ( S : set of integers) (f is a function that does computation) sum = sum of the values in S If sum is odd, output: S = {}, T = 1 sum = sum/2 output S as your set T = sum/2 partition( S ) S = S’ { compute f ( S ) output = S’ , T return SubsetSum( S’ , T ) } If A ≤ m B and B is decidable, then A is decidable If A ≤ m B and A is undecidable, then B is undecidable If A ≤ m B and B is Turingrecognizable, then so is A If A ≤ m B and A is not Turingrecognizable, then B isn’t either...
View
Full
Document
This note was uploaded on 09/16/2011 for the course COT 4210 taught by Professor Staff during the Spring '08 term at University of Central Florida.
 Spring '08
 Staff

Click to edit the document details