Formal Language, chapter 16, slide 1Copyright © 2007 by Adam Webber Chapter Sixteen: Turing Machines.
Turing’s Thesis
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
1 How to establish NP-hardness Lemma: If L 1 is NP-hard and L 1 ≤ L 2 then L 2 is NP-hard.
How to establish NP -hardness
