Lecture 16: Time Complexity and P vs NP


 June Morrison
 11 months ago
 Views:
Transcription
1 6.045 Lecture 16: Time Complexity and P vs NP 1
2 TimeBounded Complexity Classes Definition: TIME(t(n)) = { L there is a Turing machine M with time complexity O(t(n)) so that L = L(M) } = { L L is a language decided by a Turing machine with c t(n) + c running time } We showed: A = { 0 k 1 k k 0 } TIME(n log n) Puzzle: Show A TIME( (n log n)/loglog n) 2
3 An Efficient Universal TM Theorem: There is a (onetape) Turing machine U which takes as input:  the code of an arbitrary TM M  an input string w  and a string of t 1s, t > w such that U(M, w, 1 t ) halts in O( M 2 t 2 ) steps and U accepts (M, w, 1 t ) M accepts w in t steps The Universal TM with a Clock Idea: Make a multitape TM U that does the above, and runs in O( M t) steps. Convert to onetape TM. 3
4 The Time Hierarchy Theorem Intuition: If you get more time to compute, then you can solve strictly more problems. Theorem: For all reasonable f, g : N! N where for all n, g(n) > n 2 f(n) 2, TIME(f(n)) TIME(g(n)) Proof Idea: Diagonalization with a clock Make a TM N that on input M, simulates the TM M on input M for f( M ) steps, then flips the answer. We will show L(N) cannot have time complexity f(n) 4
5 The Time Hierarchy Theorem Theorem: For reasonable f, g where g(n) > n 2 f(n) 2, TIME(f(n)) TIME(g(n)) Proof Sketch: Define a TM N as follows: N(M) = Compute t = f( M ) Run U(M, M, 1 t ) and output the opposite answer. Claim: L(N) does not have time complexity f(n). Proof: Assume N runs in f(n) time, and L(N ) = L(N). By assumption, N (N ) runs in f( N ) time and outputs the opposite answer of U(N, N, 1 f( N ) ) So N (N ) accepts U(N, N, 1 f( N ) ) rejects N (N ) rejects in f( N ) steps [U is universal] This is a contradiction! 5
6 The Time Hierarchy Theorem Theorem: For reasonable f, g where g(n) > n 2 f(n) 2, TIME(f(n)) TIME(g(n)) Proof Sketch: Define a TM N as follows: N(M) = Compute t = f( M ) Run U(M, M, 1 t ) and output the opposite answer. So, L(N) does not have time complexity f(n). For what functions g(n) will N run in O(g(n)) time? 1. Compute t = f( M ) in O(g( M )) time [ reasonable ] 2. Run U(M, M, 1 t ) in O(g( M )) time Recall: U(M, w, 1 t ) halts in O( M 2 t 2 ) steps So set g(n) so that g( M ) > M 2 f( M ) 2 for all n. QED Remark: Time hierarchy also holds for multitape TMs! 6
7 The Time Hierarchy Theorem Theorem: For reasonable f, g where g(n) > n 2 f(n) 2, TIME(f(n)) TIME(g(n)) Proof Sketch: Define a TM N with Σ = 0, 1 as follows: N(0 c 1M) = Compute t = c f( 0 c 1M ) + c Run U(M, 0 c 1M, 1 t ) and output opposite answer. Claim: L(N) does not have time complexity O(f(n)). Proof: Assume N runs in c f(n) + c time, and L(N ) = L(N). Therefore N (0 c 1N ) runs in c f( 0 c 1N ) + c time and outputs the opposite of U(N, 0 c 1N, 1 c f( 0 c1n )+c ) So N (0 c 1N ) accepts U(N, 0 c 1N, 1 c f( 0 c1n )+c ) rejects N (0 c 1N ) rejects in c f( N ) + c time This is a contradiction! 7
8 The Time Hierarchy Theorem Theorem: For reasonable f, g where g(n) > n 2 f(n) 2, TIME(f(n)) TIME(g(n)) Proof Sketch: Define a TM N with Σ = 0, 1 as follows: N(0 c 1M) = Compute t = c f( 0 c 1M ) + c Run U(M, 0 c 1M, 1 t ) and output opposite answer. So, L(N) does not have time complexity f(n). For what functions g(n) will N run in O(g(n)) time? 1. Compute t = c f( 0 c 1M ) + c in O(g( 0 c 1M )) time 2. Simulate U(M, 0 c 1M, 1 t ) in O(g( 0 c 1M )) time Recall: U(M, w, 1 t ) halts in O( M 2 t 2 ) steps Set g(n) s.t. g( 0 c 1M ) > M 2 (c f( 0 c 1M ) + c) 2 for all n. Remark: Time hierarchy also holds for multitape TMs! 8
9 A Better Time Hierarchy Theorem Theorem: For reasonable f, g where g(n) > f(n) log 2 f(n), TIME(f(n)) TIME(g(n)) Corollary: TIME(n) TIME(n 2 ) TIME(n 3 ) There is an infinite hierarchy of increasingly more timeconsuming problems Question: Are there important everyday problems that are high up in this time hierarchy? A natural problem that needs exactly n 10 time? THIS IS AN OPEN QUESTION! 9
10 k N P = TIME(n k ) Polynomial Time The analogue of decidability in the world of complexity theory 10
11 The EXTENDED ChurchTuring Thesis Everyone s Intuitive Notion of Efficient Algorithms = PolynomialTime Turing Machines A controversial (dead?) thesis! Counterexamples include n 100 time algorithms, randomized algorithms, quantum algorithms, 11
12 Nondeterminism and NP 12
13 Nondeterministic Turing Machines are just like standard TMs, except: 1. The machine may proceed according to several possible transitions (like an NFA) 2. The machine accepts an input string if there exists an accepting computation history for the machine on the string 13
14 read write move 0 0, R 0 0, R, R q accept, R 0 0, R q reject 14
15 Definition: A nondeterministic TM is a 7tuple T = (Q, Σ, Γ,, q 0, q accept, q reject ), where: Q is a finite set of states Σ is the input alphabet, where Σ Γ is the tape alphabet, where Γ and Σ Γ : Q Γ 2 (Q Γ {L,R}) q 0 Q is the start state q accept Q is the accept state q reject Q is the reject state, and q reject q accept 15
16 Defining Acceptance for NTMs Let N be a nondeterministic Turing machine An accepting computation history for N on w is a sequence of configurations C 0,C 1,,C t where 1. C 0 is the start configuration q 0 w, 2. C t is an accepting configuration, 3. Each configuration C i yields C i+1 Def. N(w) accepts in t time Such a history exists N has time complexity T(n) if for all n, for all inputs of length n and for all histories, N halts in T(n) time 16
17 Definition: NTIME(t(n)) = { L L is decided by a O(t(n)) time nondeterministic Turing machine } Note: TIME(t(n)) NTIME(t(n)) Is TIME(t(n)) = NTIME(t(n)) for all t(n)? THIS IS AN OPEN QUESTION! What can be done in short NTIME that cannot be done in short TIME? 17
18 Boolean Formulas logical parentheses operations A satisfying assignment is a setting of the variables that makes the formula true = ( x y) z x = 1, y = 1, z = 1 is a satisfying assignment for Boolean variables (0 or 1) (x y) (z x)
19 A Boolean formula is satisfiable if there exists a true/false setting to the variables that makes the formula true YES NO a b c d (x y) x SAT = { is a satisfiable Boolean formula } (How are we encoding formulas? In a reasonable way!) Encoding: takes formula φ of n symbols, and outputs O(n c ) bits Decoding: takes O(n c ) bits and i, and outputs ith symbol of φ 19
20 A 3cnfformula has the form: (x 1 x 2 x 3 ) (x 4 x 2 x 5 ) (x 3 x 2 x 1 ) literals clauses Ex: (x 1 x 2 x 1 ) (x 3 x 1 ) (x 3 x 2 x 1 ) (x 1 x 2 x 3 ) ( x 4 x 2 x 1 ) (x 3 x 1 x 1 ) (x 1 x 2 x 3 ) (x 3 x 2 x 1 ) 3SAT = { is a satisfiable 3cnfformula } 20
21 3SAT = { is a satisfiable 3cnfformula } Theorem: 3SAT NTIME(n c ) for some constant c > 1 Proof Idea: On input : 1. Check if the formula is in 3cnf 2. For each variable v in, nondeterministically substitute either 0 or 1 in place of v ( x y x ) ( 0 y 0 ) ( 1 y 1 ) ( ) ( ) 3. Evaluate the formula and accept iff is true 21
22 NP = NTIME(n k ) k N Nondeterministic Polynomial Time The analogue of recognizability 22
23 Theorem: L NP There is a constant k and polynomialtime TM V such that L = { x y ϵ Σ* [ y x k and V(x,y) accepts ] } Proof: (1) If L = { x y y x k and V(x,y) accepts } then L NP Given the polytime TM V, our NP machine for L is: N(x): Nondeterministically guess y. Run V(x,y) (2) If L NP then L = { x y y x k and V(x,y) accepts } Let N be a nondet. polytime TM that decides L. Define a TM V(x,y) which accepts y encodes an accepting computation history of N on x 23
24 Moral: A language L is in NP if and only if there are polynomiallength proofs for membership in L 3SAT = { y such that is in 3cnf and y is a satisfying assignment to } SAT = { y such that is a Boolean formula and y is a satisfying assignment to } 24
25 NP = Problems with the property that, once you have the answer, it is easy to verify the answer SAT is in NP because a satisfying assignment is a polynomiallength proof that a formula is satisfiable When ϵ SAT, I can prove that fact to you with a short proof you can quickly verify 25
26 The Hamiltonian Path Problem b f e g a d i c h A Hamiltonian path traverses through each node exactly once 26
27 Assume a reasonable encoding of graphs (example: the adjacency matrix is reasonable) HAMPATH = { (G,s,t) G is a directed graph with a Hamiltonian path from s to t } Theorem: HAMPATH NP A Hamiltonian path P in G from s to t is a proof that (G,s,t) is in HAMPATH Given P (as a permutation on the nodes) can easily check that it is a path through all nodes exactly once 27
28 The kclique Problem a d f c b e g kclique = complete subgraph on k nodes 28
29 CLIQUE = { (G,k) G is an undirected graph with a kclique } Theorem: CLIQUE NP A kclique in G is a proof that (G, k) is in CLIQUE Given a subset S of k nodes from G, we can efficiently check that all possible edges are present between the nodes in S 29
30 A language is in NP if and only if there are polynomiallength proofs for membership in the language P = the problems that can be efficiently solved NP = the problems where proposed solutions can be efficiently verified Is P = NP? can problem solving be automated? 30
31 $$$ P = NP? $$$ 31
32 If P = NP Mathematicians/creators may be out of a job Cryptography as we know it may be impossible no oneway functions! In principle, every aspect of daily life could be efficiently and globally optimized life as we know it would be different Conjecture: P NP 32
33 Next Episode: NPComplete Problems 33
Finish KComplexity, Start Time Complexity
6.045 Finish KComplexity, Start Time Complexity 1 Kolmogorov Complexity Definition: The shortest description of x, denoted as d(x), is the lexicographically shortest string such that M(w) halts
More informationTIME COMPLEXITY AND POLYNOMIAL TIME; NON DETERMINISTIC TURING MACHINES AND NP. THURSDAY Mar 20
TIME COMPLEXITY AND POLYNOMIAL TIME; NON DETERMINISTIC TURING MACHINES AND NP THURSDAY Mar 20 COMPLEXITY THEORY Studies what can and can t be computed under limited resources such as time, space, etc Today:
More informationLecture 17: CookLevin Theorem, NPComplete Problems
6.045 Lecture 17: CookLevin Theorem, NPComplete Problems 1 Is SAT solvable in O(n) time on a multitape TM? Logic circuits of 6n gates for SAT? If yes, then not only is P=NP, but there would be a dream
More informationCS5371 Theory of Computation. Lecture 19: Complexity IV (More on NP, NPComplete)
CS5371 Theory of Computation Lecture 19: Complexity IV (More on NP, NPComplete) Objectives More discussion on the class NP CookLevin Theorem The Class NP revisited Recall that NP is the class of language
More informationAdvanced Topics in Theoretical Computer Science
Advanced Topics in Theoretical Computer Science Part 5: Complexity (Part II) 30.01.2014 Viorica SofronieStokkermans Universität KoblenzLandau email: sofronie@unikoblenz.de 1 Contents Recall: Turing
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
More informationThe Polynomial Hierarchy
The Polynomial Hierarchy Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Motivation..synthesizing circuits is exceedingly difficulty. It is even
More informationsatisfiability (sat) Satisfiability unsatisfiability (unsat or sat complement) and validity Any Expression φ Can Be Converted into CNFs and DNFs
Any Expression φ Can Be Converted into CNFs and DNFs φ = x j : This is trivially true. φ = φ 1 and a CNF is sought: Turn φ 1 into a DNF and apply de Morgan s laws to make a CNF for φ. φ = φ 1 and a DNF
More informationTheory of Computation CS3102 Spring 2015 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2015 A tale of computers, math, problem solving, life, love and tragic death Robbie Hott www.cs.virginia.edu/~jh2jf Department of Computer Science University of Virginia
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationDe Morgan s a Laws. De Morgan s laws say that. (φ 1 φ 2 ) = φ 1 φ 2, (φ 1 φ 2 ) = φ 1 φ 2.
De Morgan s a Laws De Morgan s laws say that (φ 1 φ 2 ) = φ 1 φ 2, (φ 1 φ 2 ) = φ 1 φ 2. Here is a proof for the first law: φ 1 φ 2 (φ 1 φ 2 ) φ 1 φ 2 0 0 1 1 0 1 1 1 1 0 1 1 1 1 0 0 a Augustus DeMorgan
More informationDecidability and Undecidability
Decidability and Undecidability Major Ideas from Last Time Every TM can be converted into a string representation of itself. The encoding of M is denoted M. The universal Turing machine U TM accepts an
More informationDefinition: conp = { L L NP } What does a conp computation look like?
Space Complexity 28 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode: Guess string y of x k length and the machine accepts
More information6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch
6.045: Automata, Computability, and Complexity (GITCS) Class 15 Nancy Lynch Today: More Complexity Theory Polynomialtime reducibility, NPcompleteness, and the Satisfiability (SAT) problem Topics: Introduction
More informationComputability Theory. CS215, Lecture 6,
Computability Theory CS215, Lecture 6, 2000 1 The Birth of Turing Machines At the end of the 19th century, Gottlob Frege conjectured that mathematics could be built from fundamental logic In 1900 David
More informationThe Complexity of Optimization Problems
The Complexity of Optimization Problems Summary Lecture 1  Complexity of algorithms and problems  Complexity classes: P and NP  Reducibility  Karp reducibility  Turing reducibility Uniform and logarithmic
More informationLecture 3: Reductions and Completeness
CS 710: Complexity Theory 9/13/2011 Lecture 3: Reductions and Completeness Instructor: Dieter van Melkebeek Scribe: Brian Nixon Last lecture we introduced the notion of a universal Turing machine for deterministic
More informationTime Complexity. Definition. Let t : n n be a function. NTIME(t(n)) = {L L is a language decidable by a O(t(n)) deterministic TM}
Time Complexity Definition Let t : n n be a function. TIME(t(n)) = {L L is a language decidable by a O(t(n)) deterministic TM} NTIME(t(n)) = {L L is a language decidable by a O(t(n)) nondeterministic
More informationDRAFT. Diagonalization. Chapter 4
Chapter 4 Diagonalization..the relativized P =?NP question has a positive answer for some oracles and a negative answer for other oracles. We feel that this is further evidence of the difficulty of the
More informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 24 Last time Relationship between models: deterministic/nondeterministic Class P Today Class NP Sofya Raskhodnikova Homework 9 due Homework 0 out 4/5/206 L24. Iclicker
More informationLecture 18: More NPComplete Problems
6.045 Lecture 18: More NPComplete Problems 1 The Clique Problem a d f c b e g Given a graph G and positive k, does G contain a complete subgraph on k nodes? CLIQUE = { (G,k) G is an undirected graph with
More informationLecture 2: Tape reduction and Time Hierarchy
Computational Complexity Theory, Fall 2010 August 27 Lecture 2: Tape reduction and Time Hierarchy Lecturer: Peter Bro Miltersen Scribe: Andreas Hummelshøj Jakobsen Tape reduction Theorem 1 (ktapes 2tape
More informationLecture Notes: The Halting Problem; Reductions
Lecture Notes: The Halting Problem; Reductions COMS W3261 Columbia University 20 Mar 2012 1 Review Key point. Turing machines can be encoded as strings, and other Turing machines can read those strings
More informationChapter 1  Time and Space Complexity. deterministic and nondeterministic Turing machine time and space complexity classes P, NP, PSPACE, NPSPACE
Chapter 1  Time and Space Complexity deterministic and nondeterministic Turing machine time and space complexity classes P, NP, PSPACE, NPSPACE 1 / 41 Deterministic Turing machines Definition 1.1 A (deterministic
More informationP, NP, NPComplete, and NPhard
P, NP, NPComplete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NPComplete and NPHard problems Algorithm time complicity Outline What is this course
More informationENEE 459E/CMSC 498R Inclass exercise February 10, 2015
ENEE 459E/CMSC 498R Inclass exercise February 10, 2015 In this inclass exercise, we will explore what it means for a problem to be intractable (i.e. it cannot be solved by an efficient algorithm). There
More informationMa/CS 117c Handout # 5 P vs. NP
Ma/CS 117c Handout # 5 P vs. NP We consider the possible relationships among the classes P, NP, and conp. First we consider properties of the class of NPcomplete problems, as opposed to those which are
More informationTopics in Complexity Theory
Topics in Complexity Theory Announcements Final exam this Friday from 12:15PM3:15PM Please let us know immediately after lecture if you want to take the final at an alternate time and haven't yet told
More informationCS154, Lecture 10: Rice s Theorem, Oracle Machines
CS154, Lecture 10: Rice s Theorem, Oracle Machines Moral: Analyzing Programs is Really, Really Hard But can we more easily tell when some program analysis problem is undecidable? Problem 1 Undecidable
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationLecture 22: PSPACE
6.045 Lecture 22: PSPACE 1 VOTE VOTE VOTE For your favorite course on automata and complexity Please complete the online subject evaluation for 6.045 2 Final Exam Information Who: You On What: Everything
More informationComputational Complexity: A Modern Approach. Draft of a book: Dated January 2007 Comments welcome!
i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome! Sanjeev Arora and Boaz Barak Princeton University complexitybook@gmail.com Not to be reproduced or distributed
More informationTuring Machines Part III
Turing Machines Part III Announcements Problem Set 6 due now. Problem Set 7 out, due Monday, March 4. Play around with Turing machines, their powers, and their limits. Some problems require Wednesday's
More information6.045 Final Exam Solutions
6.045J/18.400J: Automata, Computability and Complexity Prof. Nancy Lynch, Nati Srebro 6.045 Final Exam Solutions May 18, 2004 Susan Hohenberger Name: Please write your name on each page. This exam is open
More informationAn introduction to Parameterized Complexity Theory
An introduction to Parameterized Complexity Theory May 15, 2012 A motivation to parametrize Definitions Standard Complexity Theory does not distinguish between the distinct parts of the input. It categorizes
More information1 Deterministic Turing Machines
Time and Space Classes Exposition by William Gasarch 1 Deterministic Turing Machines Turing machines are a model of computation. It is believed that anything that can be computed can be computed by a Turing
More informationEssential facts about NPcompleteness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NPcompleteness: Any NPcomplete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomialtime solutions
More information1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
More informationCS154, Lecture 12: Kolmogorov Complexity: A Universal Theory of Data Compression
CS154, Lecture 12: Kolmogorov Complexity: A Universal Theory of Data Compression Rosencrantz & Guildenstern Are Dead (Tom Stoppard) Rigged Lottery? And the winning numbers are: 1, 2, 3, 4, 5, 6 But is
More informationNP Complete Problems. COMP 215 Lecture 20
NP Complete Problems COMP 215 Lecture 20 Complexity Theory Complexity theory is a research area unto itself. The central project is classifying problems as either tractable or intractable. Tractable Worst
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A contextfree grammar is in Chomsky normal form if every rule is of the form:
More information6.840 Language Membership
6.840 Language Membership Michael Bernstein 1 Undecidable INP Practice final Use for A T M. Build a machine that asks EQ REX and then runs M on w. Query INP. If it s in P, accept. Note that the language
More informationLecture 8. MINDNF = {(φ, k) φ is a CNF expression and DNF expression ψ s.t. ψ k and ψ is equivalent to φ}
6.841 Advanced Complexity Theory February 28, 2005 Lecture 8 Lecturer: Madhu Sudan Scribe: Arnab Bhattacharyya 1 A New Theme In the past few lectures, we have concentrated on nonuniform types of computation
More information16.1 Countability. CS125 Lecture 16 Fall 2014
CS125 Lecture 16 Fall 2014 16.1 Countability Proving the nonexistence of algorithms for computational problems can be very difficult. Indeed, we do not know how to prove P NP. So a natural question is
More informationLecture 13: Foundations of Math and Kolmogorov Complexity
6.045 Lecture 13: Foundations of Math and Kolmogorov Complexity 1 SelfReference and the Recursion Theorem 2 Lemma: There is a computable function q : Σ* Σ* such that for every string w, q(w) is the description
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turingrecognizable languages that were not mentioned in previous lectures. In particular, we will
More informationMTAT Complexity Theory October 13th14th, Lecture 6
MTAT.07.004 Complexity Theory October 13th14th, 2011 Lecturer: Peeter Laud Lecture 6 Scribe(s): Riivo Talviste 1 Logarithmic memory Turing machines working in logarithmic space become interesting when
More information2 P vs. NP and Diagonalization
2 P vs NP and Diagonalization CS 6810 Theory of Computing, Fall 2012 Instructor: David Steurer (sc2392) Date: 08/28/2012 In this lecture, we cover the following topics: 1 3SAT is NP hard; 2 Time hierarchies;
More information6.841/18.405J: Advanced Complexity Wednesday, February 12, Lecture Lecture 3
6.841/18.405J: Advanced Complexity Wednesday, February 12, 2003 Lecture Lecture 3 Instructor: Madhu Sudan Scribe: Bobby Kleinberg 1 The language MinDNF At the end of the last lecture, we introduced the
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION "Winter" 2018 http://cseweb.ucsd.edu/classes/wi18/cse105ab/ Today's learning goals Sipser Ch 4.2 Trace highlevel descriptions of algorithms for computational problems. Use
More informationChomsky Normal Form and TURING MACHINES. TUESDAY Feb 4
Chomsky Normal Form and TURING MACHINES TUESDAY Feb 4 CHOMSKY NORMAL FORM A contextfree grammar is in Chomsky normal form if every rule is of the form: A BC A a S ε B and C aren t start variables a is
More informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages ContextFree Languages Regular Languages
More information6.045J/18.400J: Automata, Computability and Complexity Final Exam. There are two sheets of scratch paper at the end of this exam.
6.045J/18.400J: Automata, Computability and Complexity May 20, 2005 6.045 Final Exam Prof. Nancy Lynch Name: Please write your name on each page. This exam is open book, open notes. There are two sheets
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Space Complexity John E. Savage Brown University February 11, 2008 John E. Savage (Brown University) CSCI 1590 Intro to Computational Complexity February 11,
More informationTuring Machines Part II
Turing Machines Part II Problem Set Set Five Five due due in in the the box box up up front front using using a late late day. day. Hello Hello Condensed Slide Slide Readers! Readers! This This lecture
More informationComplexity Theory. Jörg Kreiker. Summer term Chair for Theoretical Computer Science Prof. Esparza TU München
Complexity Theory Jörg Kreiker Chair for Theoretical Computer Science Prof. Esparza TU München Summer term 2010 Lecture 4 NPcompleteness Recap: relations between classes EXP PSPACE = NPSPACE conp NP conp
More informationLecture 17. In this lecture, we will continue our discussion on randomization.
ITCS:CCT09 : Computational Complexity Theory May 11, 2009 Lecturer: Jayalal Sarma M.N. Lecture 17 Scribe: Hao Song In this lecture, we will continue our discussion on randomization. 1 BPP and the Polynomial
More informationNotes on Complexity Theory Last updated: October, Lecture 6
Notes on Complexity Theory Last updated: October, 2015 Lecture 6 Notes by Jonathan Katz, lightly edited by Dov Gordon 1 PSPACE and PSPACECompleteness As in our previous study of N P, it is useful to identify
More informationCSCE 551: ChinTser Huang. University of South Carolina
CSCE 551: Theory of Computation ChinTser Huang huangct@cse.sc.edu University of South Carolina ChurchTuring Thesis The definition of the algorithm came in the 1936 papers of Alonzo Church h and Alan
More informationPolynomialTime Reductions
Reductions 1 PolynomialTime Reductions Classify Problems According to Computational Requirements Q. Which problems will we be able to solve in practice? A working definition. [von Neumann 1953, Godel
More informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation 1 / 33 Lecture 20: Overview Incompressible strings Minimal Length Descriptions Descriptive Complexity Dr. Sarmad Abbasi
More informationNPComplete problems
NPComplete problems NPcomplete problems (NPC): A subset of NP. If any NPcomplete problem can be solved in polynomial time, then every problem in NP has a polynomial time solution. NPcomplete languages
More informationSpace is a computation resource. Unlike time it can be reused. Computational Complexity, by Fu Yuxi Space Complexity 1 / 44
Space Complexity Space is a computation resource. Unlike time it can be reused. Computational Complexity, by Fu Yuxi Space Complexity 1 / 44 Synopsis 1. Space Bounded Computation 2. Logspace Reduction
More informationAutomata Theory CS Complexity Theory I: Polynomial Time
Automata Theory CS411201517 Complexity Theory I: Polynomial Time David Galles Department of Computer Science University of San Francisco 170: Tractable vs. Intractable If a problem is recursive, then
More informationSAT, Coloring, Hamiltonian Cycle, TSP
1 SAT, Coloring, Hamiltonian Cycle, TSP Slides by Carl Kingsford Apr. 28, 2014 Sects. 8.2, 8.7, 8.5 2 Boolean Formulas Boolean Formulas: Variables: x 1, x 2, x 3 (can be either true or false) Terms: t
More informationLecture 23: More PSPACEComplete, Randomized Complexity
6.045 Lecture 23: More PSPACEComplete, Randomized Complexity 1 Final Exam Information Who: You On What: Everything through PSPACE (today) With What: One sheet (doublesided) of notes are allowed When:
More information3 Probabilistic Turing Machines
CS 252  Probabilistic Turing Machines (Algorithms) Additional Reading 3 and Homework problems 3 Probabilistic Turing Machines When we talked about computability, we found that nondeterminism was sometimes
More informationComputational Models Lecture 9, Spring 2009
Slides modified by Benny Chor, based on original slides by Maurice Herlihy, Brown University. p. 1 Computational Models Lecture 9, Spring 2009 Reducibility among languages Mapping reductions More undecidable
More informationTuring machines and linear bounded automata
and linear bounded automata Informatics 2A: Lecture 29 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 25 November, 2011 1 / 13 1 The Chomsky hierarchy: summary 2 3 4 2 / 13
More informationΤαουσάκος Θανάσης Αλγόριθμοι και Πολυπλοκότητα II 7 Φεβρουαρίου 2013
Ταουσάκος Θανάσης Αλγόριθμοι και Πολυπλοκότητα II 7 Φεβρουαρίου 2013 Alternation: important generalization of nondeterminism Redefining NonDeterminism in terms of configurations: a configuration lead
More informationCSCI 1010 Models of Computa3on. Lecture 11 Proving Languages NPComplete
CSCI 1010 Models of Computa3on Lecture 11 Proving Languages NPComplete Overview P3me reduc3ons Composi3on of P3me reduc3ons Reduc3on from CIRCUIT SAT to SAT SAT is NPcomplete. 3SAT is NPcomplete.
More informationFinal Exam Comments. UVa  cs302: Theory of Computation Spring < Total
UVa  cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More informationLecture 12: Mapping Reductions
Lecture 12: Mapping Reductions October 18, 2016 CS 1010 Theory of Computation Topics Covered 1. The Language EQ T M 2. Mapping Reducibility 3. The Post Correspondence Problem 1 The Language EQ T M The
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More informationDefinition: Alternating time and space Game Semantics: State of machine determines who
CMPSCI 601: Recall From Last Time Lecture 3 Definition: Alternating time and space Game Semantics: State of machine determines who controls, White wants it to accept, Black wants it to reject. White wins
More informationTuring Machines Part II
Turing Machines Part II Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing
More informationA.Antonopoulos 18/1/2010
Class DP Basic orems 18/1/2010 Class DP Basic orems 1 Class DP 2 Basic orems Class DP Basic orems TSP Versions 1 TSP (D) 2 EXACT TSP 3 TSP COST 4 TSP (1) P (2) P (3) P (4) DP Class Class DP Basic orems
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semidecidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Complement Classes and the Polynomial Time Hierarchy John E. Savage Brown University February 9, 2009 John E. Savage (Brown University) CSCI 1590 Intro to Computational
More informationTuring Machines (TM) The Turing machine is the ultimate model of computation.
TURING MACHINES Turing Machines (TM) The Turing machine is the ultimate model of computation. Alan Turing (92 954), British mathematician/engineer and one of the most influential scientists of the last
More informationCSE 105 Theory of Computation
CSE 105 Theory of Computation http://www.jflap.org/jflaptmp/ Professor Jeanne Ferrante 1 Undecidability Today s Agenda Review and More Problems A NonTR Language Reminders and announcements: HW 7 (Last!!)
More informationTheory of Computation. Ch.8 Space Complexity. wherein all branches of its computation halt on all
Definition 8.1 Let M be a deterministic Turing machine, DTM, that halts on all inputs. The space complexity of M is the function f : N N, where f(n) is the maximum number of tape cells that M scans on
More informationComputer Sciences Department
Computer Sciences Department 1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Computer Sciences Department 3 ADVANCED TOPICS IN C O M P U T A B I L I T Y
More informationOn the Expressive Power of Monadic Least Fixed Point Logic
On the Expressive Power of Monadic Least Fixed Point Logic Nicole Schweikardt Institut für Informatik, HumboldtUniversität Berlin, Unter den Linden 6, D10099 Berlin, Germany, Email: schweika@informatik.huberlin.de,
More informationDRAFT. PCP and Hardness of Approximation. Chapter 19
Chapter 19 PCP and Hardness of Approximation...most problem reductions do not create or preserve such gaps...to create such a gap in the generic reduction (cf. Cook)...also seems doubtful. The intuitive
More informationBusch Complexity Lectures: Turing s Thesis. Costas Busch  LSU 1
Busch Complexity Lectures: Turing s Thesis Costas Busch  LSU 1 Turing s thesis (1930): Any computation carried out by mechanical means can be performed by a Turing Machine Costas Busch  LSU 2 Algorithm:
More informationBoolean circuits. Lecture Definitions
Lecture 20 Boolean circuits In this lecture we will discuss the Boolean circuit model of computation and its connection to the Turing machine model. Although the Boolean circuit model is fundamentally
More informationDefinition: Alternating time and space Game Semantics: State of machine determines who
CMPSCI 601: Recall From Last Time Lecture Definition: Alternating time and space Game Semantics: State of machine determines who controls, White wants it to accept, Black wants it to reject. White wins
More informationLecture 14: Recursive Languages
Lecture 14: Recursive Languages Instructor: Ketan Mulmuley Scriber: Yuan Li February 24, 2015 1 Recursive Languages Definition 1.1. A language L Σ is called recursively enumerable (r. e.) or computably
More informationOn Rice s theorem. Hans Hüttel. October 2001
On Rice s theorem Hans Hüttel October 2001 We have seen that there exist languages that are Turingacceptable but not Turingdecidable. An important example of such a language was the language of the Halting
More informationDRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms rootfinding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
More informationMachine Characterizations of the Classes of the WHierarchy
Machine Characterizations of the Classes of the WHierarchy Yijia Chen and Jörg Flum Abteilung für Mathematische Logik, Universität Freiburg, Eckerstr. 1, 79104 Freiburg, Germany. chen@zermelo.mathematik.unifreiburg.de
More informationMm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2player games, genetic algorithms (hps) Mm9 Complex Problems in Network Planning (JMP)
Algorithms and Architectures II HP Schwefel, Jens M. Pedersen Mm6 Advanced Graph Algorithms (hps) Mm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2player games, genetic algorithms (hps) Mm9
More informationChapter 2 Algorithms and Computation
Chapter 2 Algorithms and Computation In this chapter, we first discuss the principles of algorithm and computation in general framework, common both in classical and quantum computers, then we go to the
More informationTheory of Computation Lecture Notes. Problems and Algorithms. Class Information
Theory of Computation Lecture Notes Prof. YuhDauh Lyuu Dept. Computer Science & Information Engineering and Department of Finance National Taiwan University Problems and Algorithms c 2004 Prof. YuhDauh
More informationComplexity and NPcompleteness
Lecture 17 Complexity and NPcompleteness Supplemental reading in CLRS: Chapter 34 As an engineer or computer scientist, it is important not only to be able to solve problems, but also to know which problems
More informationLecture 20: PSPACE. November 15, 2016 CS 1010 Theory of Computation
Lecture 20: PSPACE November 15, 2016 CS 1010 Theory of Computation Recall that PSPACE = k=1 SPACE(nk ). We will see that a relationship between time and space complexity is given by: P NP PSPACE = NPSPACE
More information