day16 - Equivalence of Models Click to edit Master subtitle...

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 Equivalence of Models Equivalency of computation by S - programs, register machines, factor replacement systems, recursive functions and Turing machines
Background image of page 1

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

View Full DocumentRight Arrow Icon
Click to edit Master subtitle style 10/4/11 S-Machine l REGISTER
Background image of page 2
10/4/11 Dec 2, © UCF (Charles E. 33 S Program ≤ Reg. Machine Let P be an S Program consisting of m instructions computing f(x1,…, xn). Assume the highest indexed temporary variable is Z t Define the mapping g, g(X i ) = i, 1…iw n, g(Y) = n+1, and g(Z j ) = n+j+1, 1&jt t. Change each IF V±0 GOTO L to IF V™ 0 GOTO A k , where L is the k-th instruction, or if L is E, k=m+1 Map the j-th S instruction by [A j ] V V maps to 2j-1. DEC n+t+2 (2j,2j) 2j. DEC n+t+2 (2j+1,2j+1) [A j ] V V+1 maps to 2j-1. INC g(v) (2j) 2j. DEC n+t+2 (2j+1,2j+1) [A j ] V V-1 maps to
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 Reg. Machine ≤ S Program Let M be a Register Machine consisting of m instructions computing f(x1,…, xn). Assume highest indexed register is R s Define the mapping g, g(i)=X i
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 / 10

day16 - Equivalence of Models Click to edit Master subtitle...

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