1. Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink dogs, …. But also P, NP, NP-completeness, …..

2. Introduction to computational intractability Is my problem efficiently solved by a computer? an automatic machine an algorithm?

3. What’s a problem? Decision problems:each instance is a question Formal definition with language theory More natural problems: “meta-language” encoding scheme That is the problem ….

4. What’s an algorithm? The pink dog question Does a pink dog exist?Does a pink dog exist (outside London)? Since the answer is yes, it can be answered Since there are only a finite number of dogs (outside London) and since for each one a can decide whether it is pink or not it can be answered. Will be ever exist any pink dog outside London? To answer it one needs a formal model of dogs.

5. What’s an algorithm? Computability models o Lambda-calculus (A. Church, 1931) o General recursive functions (K. Gödel, 1934) o Turing machines (A. Turing, 1936) o Random-Access Machines, … Church thesis Before the first computer The pink dog question

6. What’s an algorithm: the Turing machine model From finite states automaton ….. to Turing machines 1-tape (deterministic) Turing Machine (DTM) multi-tape Turing machines non-deterministic Turing machines (NDTM) o transition function transition relation o put non-determinism at the beginning equivalence between all these Turing machines models universal Turing Machine Example

7. Problems solved by Turing machines Is L recognized by M? Is L decided by L? The halting problem: an example of undecidable problem M: DTM, L a language on the same input alphabet Decision problem solved by an algorithm? (through an encoding scheme)

8. Complexity of Turing machines Complexity of DTM (halting for each instance) Complexity of NDTM Polynomial-time: considered as efficiency (Cobham-Edmond’s thesis) Difference between DTM and NDTM (from complexity point of view) From languages to problems (reasonable encoding schemes) A notion of efficiency

9. P, NP and NP-completeness The class P The class NP Exponentially solving problems in NP Polynomial reductions NP-complete problems

10. Some NP-complete problems SAT Cook’s theorem (1971) How to prove NP-completeness after Cook? 3-SAT to be continued during the next class

11. Enjoy your vacation

12. 01100 b b b b b b … q0q0 q1q1 q1q1 q2q2 qNqN An Example of 1-tape Deterministic Turing Machine

13. 01110 b b b b b b … q0q0 q1q1 q1q1 q2q2 q2q2 q2q2

14. 1110 b b b b b b … q4q4 q4q4 q4q4 q4q4 q3q3 q2q2 b

15. b110 b b b b b b … q4q4 q0q0 q1q1 q2q2 q2q2 b

16. b11 b b b b b b … q4q4 q4q4 q3q3 q2q2 bb

17. b1b b b b b b b … q4q4 q0q0 qNqN b

18. b110 0 b b b b b … q0q0

19. b110 b b b b b b … q4q4 q4q4 q4q4 q3q3 q2q2 b

20. b1b0 b b b b b b … q4q4 q0q0 q1q1 q2q2 b

21. b1b b b b b b b … q3q3 q3q3 q2q2 b b

22. bbb b b b b b b … q3q3 q0q0 qYqY b What is the accepted language?