cot6410F10FinalSampleQuestions

cot6410F10FinalSampleQuestions - COT 6410 Fall 2010 Final...

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

View Full Document Right Arrow Icon
COT 6410 Fall 2010 Final Exam Sample Questions 1 . Let set A be recursive, B be re non-recursive and C be non-re. Choosing from among (REC) recursive , (RE) re non-recursive , (NR) non-re , categorize the set D in each of a) through d) by listing all possible categories. No justification is required. a.) D = ~C b.) D (A C) c.) D = ~B d.) D = B A 2. Prove that the Halting Problem (the set K 0 ) is not recursive (decidable) within any formal model of computation. (Hint: A diagonalization proof is required here.) 3. Using reduction from the known undecidable HasZero, HZ = { f | x f(x) = 0 } , show the non- recursiveness (undecidability) of the problem to decide if an arbitrary primitive recursive function g has the property IsZero, Z = { f | x f(x) = 0 } . 4 . Choosing from among (D) decidable , (U) undecidable , (?) unknown , categorize each of the following decision problems. No proofs are required. Problem / Language Class
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

cot6410F10FinalSampleQuestions - COT 6410 Fall 2010 Final...

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

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