Unformatted text preview: . “ . (where M , above, is a deterministic Turing machine) is NP-complete. 5. A language L is co NP-hard if for every L ∈ co NP it holds that L ≤ p L ; it is co NP-complete if furthermore L ∈ co NP . Prove or disprove: L is NP-complete iﬀ ¯ L is co NP-complete. 6. Challenge question – optional. Show a universal non-deterministic Turing ma-chine U such that (1) U ( M,x ) = M ( x ) for any non-deterministic Turing machine M for which M ( x ) is deﬁned, and (2) for every M there exists a constant c such that if M ( x ) runs in time T then U ( M,x ) runs in time O ( T ) (once again, the constant in the big-O notation may depend on M ). 1...
View Full Document
- Fall '08
- Non-deterministic Turing machine, Professor Jonathan Katz