# FR-PR - FACTOR RECURSIVE Computer Science Department...

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

Computer Science Department University of Central Florida FACTOR RECURSIVE COP 6410 Thomas & Tracy

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

View Full Document
Factor Replacement < Recursive page 2 Universal Machine In the process of doing this reduction, we will build a Universal Machine. This is a single recursive function with two arguments. The first specifies the factor system (encoded) and the second the argument to this factor system. The Universal Machine will then simulate the given machine on the selected input.
Factor Replacement < Recursive page 3 Addition by FRS Addition is 3 x1 5 x2 becomes 2 x1+x2 or, in more details, 2 0 3 x1 5 x2 becomes 2 x1+x2 3 0 5 0 2 / 3 2 / 5 Note that these systems are sometimes presented as rewriting rules of the form bx ax meaning that a number that has a factored as bx can have the factor b replaced by an a. The previous rules would then be written 3x 2x 5x 2x

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

View Full Document
Factor Replacement < Recursive page 4 Building New Functions Composition: If G, H 1 , … , H k are already known to be primitive recursive, then
This is the end of the preview. Sign up to access the rest of the 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.

### Page1 / 9

FR-PR - FACTOR RECURSIVE Computer Science Department...

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

View Full Document
Ask a homework question - tutors are online