This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: COT 6315/CIS 4930 (Fall05,Sitharam) Sample Test 3 and rough solutions – for detailed solutions, especially proofs, visit TA’s office hours. Note also that this sample test does not cover stuff like hierarchy theorems, and general containments between deterministic and nondeterministic time classes – they are however required syllabus for the actual test 1. Classify the following languages as being: both r.e. and cor.e; (co)r.e but not enough information to tell where its complement is; r.e but not cor.e; cor.e, but not r.e; or neither r.e nor cor.e. In all cases, fully justify your answer (the concept of reductions would be useful in some cases). NOTE 1: If the question concerns an entire class of languages G , your upper bound C should hold for the entire class G ; for the lower bound D , give the largest D that does not contain at least one member of the class G . I.e., you are lowerbounding the complexity of the most difficult set in the class G ....
View
Full Document
 Spring '08
 Staff
 Computational complexity theory, Order theory, Halting problem, simple algorithm exists

Click to edit the document details