A Turing machine with doubly innite tape is similar to an
Chapter , Problem 3.11(choose chapter or problem)
A Turing machine with doubly innite tape is similar to an ordinary Turing machine, but its tape is innite to the left as well as to the right. The tape is initially lled with blanks except for the portion that contains the input. Computation is dened as usual except that the head never encounters an end to the tape as it moves leftward. Show that this type of Turing machine recognizes the class of Turing-recognizable languages.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer