recursiveTuring - Primitive Recursive Turing Machine Every...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Primitive Recursive ≤ Turing Machine Every instance of Primitive Recursive can be replaced by an equivalent instance of Turing Machine Primitive Recursive Base functions Composition Iteration Bounded Minimization
Background image of page 1

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

View Full DocumentRight Arrow Icon
Turing Computable a Turing computation of some n-ary function F is to assume that the machine starts with a tape containing the n inputs, x1, . .. , xn in the form …01 x1 01 x2 0…01 xn 0 and ends with …01 x1 01 x2 0…01 xn 01 y 0 where y = F(x1, . .. , xn).
Background image of page 2
TM - Base Machine R -- move right over any scanned symbol L -- move left over any scanned symbol 0 -- write a 0 in current scanned square 1 -- write a 1 in current scanned square
Background image of page 3

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

View Full DocumentRight Arrow Icon
TM - SubMachine R -- move right to next 0 L -- move left to next 0 C k -- copies k-th preceding value. R 1 L 1 1 0 R L k R 0 R k k+1 1 L k+1 1
Background image of page 4
PR - SubMachine Translate -- moves a value left one tape square Shift -- shift a rightmost value left, destroying value
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 9

recursiveTuring - Primitive Recursive Turing Machine Every...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online