1 / 5

Variants of Turing Machines

[Section 3.2]. Variants of Turing Machines. what if a TM has more tapes ? several heads ? This section: we’ll give detailed descriptions of our machines but not give detailed ± -functions. [Section 3.2]. Multitape Turing Machines. have to redefine ± -function:

violet
Download Presentation

Variants of Turing Machines

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. [Section 3.2] Variants of Turing Machines • what if a TM has more tapes ? several heads ? • This section: we’ll give detailed descriptions of our machines but not give detailed ±-functions.

  2. [Section 3.2] Multitape Turing Machines • have to redefine ±-function: • Thm 3.13: Every multitape TM has an equiv. single-tape TM.

  3. [Section 3.2] Nondeterministic Turing Machines • have to redefine ±-function: • Thm 3.16: Every nondeterministic TM has an equivalent deterministic TM.

  4. [Section 3.2] Enumerators An alternative name for Turing-recognizable languages is recursively enumerable languages. An enumerator is a TM-like “printer” with no input and an extra output tape that prints all strings in a given language.

  5. [Section 3.2] Enumerators Thm 3.21: A language is Turing-recognizable iff there is an enumerator for it.

More Related