Unformatted text preview: A ≤ m * 1 * . 5. (25%) Let J = { w  either w = x for some x ∈ A TM , or w = 1 y for some y / ∈ A TM } . Show that A TM ≤ m J and A TM ≤ m ¯ J . Conclude that J and ¯ J are nonTuringrecognizable. 6. (Further studies: No marks) Let K = {h M i  M is a TM and L ( M ) = {h M i}} . Show that neither K nor the complement of K is Turingrecognizable. 1...
View
Full Document
 Spring '10
 H.F.
 Computer Science, Set Theory, Orders of magnitude, Halting problem, Correspondence problem, silly Post Correspondence

Click to edit the document details