day20 - RECURSIVE m 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 RECURSIVE m
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 Standard Turing Computation Our notion of standard Turing computability of some n-ary function F assumes that the machine starts with a tape containing the n inputs, x1, … , xn in the form …01x101x20…01xn0 and ends with …01x101x20…01xn01y0 where y = F(x1, … , xn).
Background image of page 2
Dec 2, 2007/COT5310 © UCF (Charles E. Hughes) 33 More Helpers To build our simulation we need to construct some useful submachines, in addition to the R , L , R, L, and Ck machines already defined. T -- translate moves a value left one tape square …? 0… Shift -- shift a rightmost value left, destroying value to its left …01x101x20 Rotk -- Rotate a k value sequence one slot to the left …0 1x101x20…01xk0… l … 0 1x20…01xk01x10… R1 L0 R R 1 L T R 0 k L k k+1 1 L k L 0 T k L k+1 L 1 T L 0 T 0
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,
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 / 8

day20 - RECURSIVE m 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