day11 - Click to edit Master subtitle style 10/4/11...

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: Click to edit Master subtitle style 10/4/11 Recursive Functions Primitive and & -Recursive Click to edit Master subtitle style 10/4/11 Primitive Recursive An Incomplete Model 10/4/11 Dec 2, UCF (Charles E. 33 Basis of PRFs The primitive recursive functions are defined by starting with some base set of functions and then expanding this set via rules that create new primitive recursive functions from old ones. The base functions are: Ca(x1,,xn) = a : constant functions (x1,,xn) = xi : identity functions : aka projection S(x) = x+1 : an increment function i n I 10/4/11 Dec 2, UCF (Charles E. 44 Building New Functions Composition: If G, H1, , Hk are already known to be primitive recursive, then so is F, where F(x1,,xn) = G(H1(x1,,xn), , Hk(x1, ,xn)) Iteration (aka primitive recursion): If G, H are already known to be primitive recursive, then so is F, where F(0, x1,,xn) = G(x1,,xn) F(y+1, x1,,xn) = H(y, x1,,xn, F(y, x1, ,xn)) Dec 2,...
View Full 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 / 10

day11 - Click to edit Master subtitle style 10/4/11...

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