This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSC544 Spring 2011 Final Due Wednesday 5/11 @ noon in my oce NAME: Part I: short answers (40 points). 1. (5 points) What is the the ChurchTuring thesis? 2. (5 points) True or false: if L is an NPcomplete language and M is polynomialtime reducible to L , that is M p L , then M is also an NPcomplete language. Briey explain your answer. 1 3. (5 points) Can { a k b k  k } be considered a regular language? Briey explain your answer. 4. (5 points) Are there deterministic polynomial time algorithms for some NPcomplete problems? Briey explain your answer. 5. (5 points) What is the difference between NPcomplete and NPhard problems? 6. (5 points) True of false: context free grammars can generate languages that Turing machines cannot recognize. Briey explain your answer. 7. (5 points) Why can the functions Turing machines are able to compute and the primitive recursive functions not be considered equivalent?...
View Full
Document
 Spring '11
 Staff

Click to edit the document details