CSE 555 Theory of Computation (2/28) - Organic Origami
CSE 555 Theory of Computation (2/28) - Organic Origami
CSE 555 Theory of Computation (2/28) - Organic Origami
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Turing-recognizability<br />
A Turing machine M accepts an input string w, if there is a<br />
sequence C 1 , . . . , C k <strong>of</strong> configurations, such that<br />
1 C 1 is the start configuration <strong>of</strong> M on w: C 1 = q 0 w.<br />
2 C i yields C i+1 for each i.<br />
3 C k is an accepting configuration.<br />
The set <strong>of</strong> strings accepted by M: the language <strong>of</strong> M (the<br />
language recognized by M).<br />
A language L is Turing-recognizable (recursively enumerable),<br />
if some Turing machine recognizes it.
Change language