day25 - Exam#1 Review You are responsible for the style...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 Exam#1 Review You are responsible for the first 196 pages of these notes, except for the P=NP material.
Background image of page 1

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

View Full DocumentRight Arrow Icon
10/4/11 Dec 2, © UCF (Charles E. 22 Sample Question#1 1. Present a register machine and a factor replacement system that each produce the value 1 (true), if x>y, and 0 (false), otherwise. a) For the register machine, assume it starts with x in R2 and y in R3, and all else 0. The result must end up in R1, with R2 and R3 unchanged. b) For the FRS, assume it starts with 3x5y
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Sample Question#2 2. Prove that the following are equivalent a) S is an infinite recursive (decidable) set. b) S is the range of a monotonically increasing total recursive function. Note: f is monotonically increasing means that Ex f(x+1) > f(x).
Background image of page 3

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

View Full DocumentRight Arrow Icon
Dec 2, © UCF (Charles E. 44 Sample Question#3 3. Let A and B be re sets. For each of the following, either prove that the set is re, or give a counterexample that results in some known non-re set. a)
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course COT 5310 taught by Professor Staff during the Spring '08 term at University of Central Florida.

Page1 / 11

day25 - Exam#1 Review You are responsible for the style...

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