day17 - All Models are Equivalent Click to edit Master...

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

View Full Document Right Arrow Icon
Click to edit Master subtitle style 10/4/11 All Models are Equivalent
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 Our Plan of Attack We will now show TURING ≤ REGISTER ≤ FACTOR ≤ RECURSIVE ≤ TURING where by A ≤ B, we mean that every instance of A can be replaced by an equivalent instance of B. The transitive closure will then get us the desired result.
Background image of page 2
Click to edit Master subtitle style 10/4/11 TURING ≤ REGISTER
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 Encoding a TM’s State Assume that we have an n state Turing machine. Let the states be numbered 0,…, n-1. Assume our machine is in state 7, with its tape containing … 0 0 1 0 1 0 0 1 1 q7 0 0 0 … The underscore indicates the square being read. We denote this by the finite id 1 0 1 0 0 1 1 q7 0 In this notation, we always write down the scanned square, even if it and all symbols to its right are blank.
Background image of page 4
10/4/11 Dec 2, © UCF (Charles E. 55 More on Encoding of TM An id can be represented by a triple of natural
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

day17 - All Models are Equivalent Click to edit Master...

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