This preview shows page 1. Sign up to view the full content.
Unformatted text preview: beyond the left margin, a new blank cell is created to allow moving left. In this problem you are asked to give a formal denition of this extended Turing machine, including 1. the denition of a machine as a tuple of sets and functions 2. an appropriate set of congurations 3. an appropriate transition relation between congurations 4. the set of strings accepted by the machine Problem 3 Prove that the model of computation dened in problem 2 is not more powerful than the Turing machine as dened in the textbook, giving a method to transform any extended Turing machine (with doubly innite tape) into an equivalent regular Turing machine. Describe your transformation in detail, either by giving a formal description of the resulting Turing machine, or by providing an accurate low level description of all the steps it performs....
View
Full
Document
This note was uploaded on 01/08/2011 for the course CSE cse105 taught by Professor Cs during the Fall '10 term at UCSD.
 Fall '10
 CS

Click to edit the document details