final - CSC544 Spring 2011 Final Due Wednesday 5/11 @ noon...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 Church-Turing thesis? 2. (5 points) True or false: if L is an NP-complete language and M is polynomial-time reducible to L , that is M p L , then M is also an NP-complete 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 NP-complete problems? Briey explain your answer. 5. (5 points) What is the difference between NP-complete and NP-hard 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

Page1 / 10

final - CSC544 Spring 2011 Final Due Wednesday 5/11 @ noon...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online