This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Alternate Definition Definition: A Turingrecognizable language is a formal language for which there exists a Turing machine that will halt and accept when presented with any string in the language as input but may either halt and reject or loop forever when presented with a string not in the language. Contrast this to (Turing)decidable languages , which require that the Turing machine halts in all cases. Source: Wikipedia p. 1/1 1 Decidable Languages p. 2/1 1 Decidable Languages p. 3/1 1 Variants of TMs As in the case of FAs we can construct different variants of the Turing machine. And, as in the case of FAs, we can show that all these variants have the same computational power: they all recognize the same languages. a The most important variants: multitape TMs nondeterministic TMs a This is not to be confused with complexity , some of the variants have lower computational complexity than others for the same task. p. 4/1 1 Multitape TMs A multitape Turing machine is a 7tuple, ( Q, , , , q , q accept , q reject ) , where Q, , are all finite sets and...
View
Full
Document
This note was uploaded on 10/03/2011 for the course CSC 544 taught by Professor Staff during the Spring '11 term at Rhode Island.
 Spring '11
 Staff

Click to edit the document details