This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Assign#1 Show that prfs are closed under Fibonacci induction. Fibonacci induction means that at each induction step, y+1, after calculating the two base values is computed using the y-th and (y-1)st values. The formal hypothesis is: Assume g1, g2 and h are already known to be prf, then so is f, where f(x,0) = g1(x); f(x,1) = g2(x) f(x,y+1) = h(f(x,y),f(x,y-1)) Hint: The pairing function is useful here. Let K be the following primitive recursive function, defined by induction on the primitive recursive functions, g, h, and the pairing function. K(x,0) = &lt; g2(x), g1(x) &gt; K(x, y+1) = J(x, y, K(y,x)) J(x,y,z) = &lt; h(&lt;z&gt; 1 , &lt;z&gt; 2 ), &lt;z&gt; 1 &gt; // this is &lt; f(y+2,x), f(y+1,x)&gt;, even though f is not yet shown to be prf!! This shows K is prf. f is then defined from K as follows: f(y,x) = &lt;K(y,x)&gt; 2 // extract second value from pair encoded in K(y,x) This shows it is also a prf, as was desired. Assign # 2 1. For the sets in a) and b), write a set description that involves the use of a minimum sequence of alternating 1....
View Full Document
This note was uploaded on 07/14/2011 for the course COT 4610 taught by Professor Dutton during the Fall '10 term at University of Central Florida.
- Fall '10