day19 - RSIVEACTOR F Click to edit Master subtitle 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 URSIVE
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 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.
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 Encoding FRS Let (n, ((a1,b1), (a2,b2), … ,(an,bn)) be some factor replacement system, where (ai,bi) means that the i-th rule is aix l bix Encode this machine by the number F, p p p p n n n n n b a b a b a n n 2 2 1 2 2 1 2 11 7 5 3 2 2 2 1 1 + + -
Background image of page 3

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. 44 Simulation by Recursive # 1 We can determine the rule of F that applies to x by RULE(F, x) = H z (1 ≤ z ≤ exp(F, 0)+1) [ exp(F, 2*z-1) | x ] Note: if x is divisible by ai, and i is the least integer for which this is true, then exp(F,2*i-1) = ai where ai is the
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 / 7

day19 - RSIVEACTOR F Click to edit Master subtitle 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