Q = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar


 Lucas Harrell
 1 years ago
 Views:
Transcription
1 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 head that scans a (possibly infinite) onedimensional (bidirectional) tape divided into sections, each of which is inscribed with a 0 or 1. Computation begins with the machine, in a given "state", scanning a section. It erases what it finds there, prints a 0 or 1, moves to an adjacent section, and goes into a new state. The machine stops after transferring to the special HALT state. Figure 1: A Turing Machine The characteristics and behavior of the Turing Machine qualifies it as a finite state machine (FSM), or a finite automaton. Significantly, it separates information into two elements  that from its internal state, and that derived externally. This behavior is completely determined by three parameters: (1) The state the machine is in, (2) The number on the square it is scanning, and (3) A table of instructions or the transition table. An instruction is defined as a 5tuple, like this: (starting state, starting value, new state, new value, movement) The table of instructions specifies, for each state and binary input, what the machine should write, which direction it should move in, and which state it should go into. (e.g., "If in State 1 scanning a 0: print 1, move left, and go into State 3"). The transition table is a chart, describing the actions set for each state, or as a State Transition Diagram, representing the same information in diagrammatic form. This tape head is capable of only three actions: (1) Write on the tape (or erase from tape), only on the section being viewed, (2) Change the internal state, and (3) Move the tape 0 or 1 space, to the left or right. Usually, states are named S 0, S 1, S 2, etc. The alphabet is usually 'B', for blank, and '1' and '0'. Numbers can (but not necessarily) be represented by a series of 1s with a length of n+1 for a number n. The table can list only finitely many states, each of which becomes implicitly defined by the role it plays in the table of instructions. These states are often referred to as the "functional states" of the machine. Also, a probabilistic automaton can be defined as a Turing machine in which the transition from input and state to output and state takes place with a certain probability (e.g. "If in State 1 scanning a 0: (a) there is a 60% probability that the machine will print 1, move left, and go into State 3, and (b) there is a 40% probability that the machine will print 0, move left, and go into State 2"). Technically, a valid TM should have an action defined for every state/character pair that might occur. The formal definition of a Turing Machine M is a 7tuple (Q,,, δ, q 0, #, F) where Q = Set of states, = Finite set of symbols, the input alphabet, = Finite set of symbols, the tape alphabet, δ = Partial transition function, # = Blank,
2 q 0 Q = Initial state, and F Q = Set of final states. The transition function for Turing machines is given by δ: Q X Q X { L, R This means that when the machine is in a given state (Q) and reads a given symbol ( ) from the tape, it replaces the symbol on the tape with some other symbol ( ), goes to some other state (Q), and moves the tape head one square left (L) or right (R). Consider a transition table described in Table 1. Fig. 2 shows the corresponding state transition diagram. State Read Write Move Next State 0 0 L S1 S1 B 1 L S2 1 B R S1 0 1 R S2 S2 B 0 R S2 1 1 L S1 Table 1: State Transition Table for a Turing Machine function f(n 1,n 2,,...,n k ), we assume that initially the tape consists of n 1, n 2,..., n k, properly encoded, with each separated from the previous one by a single blank, and with the tape head is initially positioned at the leftmost bit of the first argument, and the state of the Turing machine some initial specified value. We say that the Turing machine has computed m = f(n 1,n 2,,...,n k ) if, when the machine halts, the tape consists of n 1, n 2,,..., n k, m, properly encoded, and separated by single blanks, and the read/write head back at the leftmost bit of the first argument. For example, suppose we wish to create a Turing machine to compute the function m := multiply(n 1,n 2 ) := n 1 * n 2 Suppose the input tape reads _<1>1 1 1 _ _ which encodes 3 and 4 respectively, in unary notation. (Here the position of the read/write head is marked). Then the Turing machine should HALT with its tape reading _<1>1 1 1 _ _ _ which encodes 3, 4, and 12 in unary notation. For our purposes we will assume that a Turing machine is a real computer. Hence something, which a Turing machine can compute in polynomial time, a real computer can also compute in polynomial time. An important result is: A function is computable if it can be computed by a Turing machine. Figure 2: Transition State Diagram for Turing Machine There are several conventions commonly used in Turing. We adopt the convention that numbers are represented in unary notation, i.e., that a string of n+1 successive 1s represents the nonnegative integer n. Furthermore, if we want to compute a Complexity Theory is part of theoretical computer science. It is important to understand the theoretical limits of computation, otherwise how do you know what is feasible and what is not. Complexity Theory is about decision problems. Decision problems are those that have a TRUE / FALSE answer. e.g. PRIMES = { x N : x is prime Given x N determine whether x is a prime. (Note: PRIMES P has been proved).
3 COMPOSITES = { x N: x is not prime Given x N determine whether x is not a prime. COLOURABLEk = G a graph such that G is colorable in k colors. Given a graph G determine whether it is colorable or not in k colors. Polynomial Time A decision problem is said to lie in complexity class P if one can solve it in polynomial time (in terms of the input size). These are the easy problems. Notice that a problem can lie in complexity class P even if we do not know a polynomial time algorithm for it yet. In other words it lies in P, but we do not yet know it lies in P. Complexity Classes P and cop Formally: Let I denote an instance of a problem, e.g. an integer. Let S denote a subset of all possible instances. A decision problem is then to decide if I S The decision problem PRIMES is I is an integer S is the set of primes A problem lies in P if whenever I S, this can be determined (accepted) in polynomial time. Formally: Let I denote an instance of a problem, e.g. an integer. Let S denote a subset of all possible instances. A decision problem is then to decide if I S The decision problem PRIMES is I is an integer S is the set of primes A problem lies in cop if it can be determined (accepted) in polynomial time whether I S. P and cop Note: If a problem lies in P and we enter an instance I S, we do not even guarantee that an accepting algorithm terminates. Similarly, we do not even guarantee that an accepting algorithm terminates if a problem lies in cop and we enter an instance I S. P = cop Suppose a decision problem D lies in P, we wish to show it must lie in cop. Since D lies in P, there is an algorithm that accepts instances On input of I S running in time c n (for some c where n is the input size). Now suppose we call the algorithm on an instance such that I S. Terminate the algorithm when it c reaches n + 1steps and output Do not accept Hence we can turn an algorithm for accepting positive instances into one that accepts negative instances. NonDeterministic Polynomial Time A decision problem X lies in NP if, when X is true, there is a certificate C (or proof) which can be checked in polynomial time. This means the certificate must be polynomial in length. This says nothing about how long it may take to compute the certificate. i.e. There is a proof that I S which can be checked in polynomial time. Complexity Class NP COMPOSITES clearly lie in NP since we can always exhibit a factor as a certificate, which can be checked in polynomial time. We do not know how to find a factor in polynomial time though. COLORABLEk clearly lies in NP since we can exhibit a coloring as a witness.
4 We do not know how to find the coloring in polynomial time though. Complexity Class conp The class conp is the set of problems for which when X is false, there is a certificate C (or proof) that can be checked in polynomial time. This is the set of problems for which there is a proof that I S such that the proof can be checked in polynomial time. We may not know how to generate this proof / witness / certificate in polynomial time though. Clearly COMPOSITES conp since PRIMES P NP We have COMPOSITES NP conp and P NP conp NP P NP conp conp NP and conp Unlike the classes P and conp where we had P = conp It is believed that NP conp Is P = NP? It turns out that almost all interesting problems lie in NP and P is the set of easy problems. So are all interesting problems easy, i.e. do we have P = NP? This is the main open question in Computer Science. It is like other great questions Is there intelligent life in the universe? What is the meaning of life? Will you get a job when you graduate? Complexity class NP Complete Most people believe P NP. There is a set of problems for which if we knew a polynomial time solution then we would know P =NP. In some sense these are the hardest problems in NP. These are called the NP Complete problems. Note: They are difficult in the worst case, This says nothing about the average case Examples of NP Complete problems SAT Given a boolean expression (e.g. x y z) can one find an assignment to the variables that makes the expression hold? The best algorithm for this seems to be exponential in the number of variables, i.e. try all 2 n possible assignments in turn. The problem is NP Complete. Knapsack Problem Given a set of n items, with weights w i, is it possible to put items into a sack to make a specific weight, S such that S = bw 1 1+ b2w2 + + bnwn? The time taken to solve this seems to grow exponentially with the number of weights. The Knapsack problem clearly lies in NP as we can exhibit the b i as a witness. The Knapsack problem is an NP Complete problem Note the stated problem is a decision problem. But it can be stated as a computational problem: If we can put items into a sack to make a specific weight S, find bi {0,1 such that S = bw 1 1+ b2w2 + + bnwn?
5 The decision and the computational problem are related. We can turn an oracle for the decision knapsack problem into one for the computational knapsack problem. Consider the following algorithm that assumes an oracle Ow ( [1],, wn [ ], S) for the decision knapsack problem. if (O(w[1],..., w[n],s) == false){ output = false; T = S; b[1] = b[2] =... = b[n] = 0; for (i=1; i<=n; i++){ if (T == 0){ output = (b[1],..., b[n]); if O(w[i+1],..., w[n],tw[i]) == true){ T = T  w[i]; b[i] = 1; This algorithm assumes only one such assignment of bi exists. kcolorability Given a graph G, can one color G with k colors so that no two adjacent vertices have the same color? Again this is a very hard problem in general. It is NP Complete even for k = 3. The problem is that it is easy on the average. Most graphs are not 3colorable. The trivial recursive backtracking algorithm will determine whether a graph is 3colorable in constant time on average, no matter how large the input graph is. Often we do not care that a problem is hard in the worst case. We only care if it is easy on average. Since 3Colorability is NP Complete this is evident that all NP Complete problems are easy on average.
Turing Machines and Time Complexity
Turing Machines and Time Complexity Turing Machines Turing Machines (Infinitely long) Tape of 1 s and 0 s Turing Machines (Infinitely long) Tape of 1 s and 0 s Able to read and write the tape, and move
More informationCS151 Complexity Theory. Lecture 1 April 3, 2017
CS151 Complexity Theory Lecture 1 April 3, 2017 Complexity Theory Classify problems according to the computational resources required running time storage space parallelism randomness rounds of interaction,
More informationUNITVIII COMPUTABILITY THEORY
CONTEXT SENSITIVE LANGUAGE UNITVIII COMPUTABILITY THEORY A Context Sensitive Grammar is a 4tuple, G = (N, Σ P, S) where: N Set of non terminal symbols Σ Set of terminal symbols S Start symbol of the
More informationTuring Machines (TM) Deterministic Turing Machine (DTM) Nondeterministic Turing Machine (NDTM)
Turing Machines (TM) Deterministic Turing Machine (DTM) Nondeterministic Turing Machine (NDTM) 1 Deterministic Turing Machine (DTM).. B B 0 1 1 0 0 B B.. Finite Control Twoway, infinite tape, broken into
More informationLecture 25: Cook s Theorem (1997) Steven Skiena. skiena
Lecture 25: Cook s Theorem (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Prove that Hamiltonian Path is NP
More informationReview of Complexity Theory
Review of Complexity Theory Breno de Medeiros Department of Computer Science Florida State University Review of Complexity Theory p.1 Turing Machines A traditional way to model a computer mathematically
More informationAbout the relationship between formal logic and complexity classes
About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular
More informationan efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem.
1 More on NP In this set of lecture notes, we examine the class NP in more detail. We give a characterization of NP which justifies the guess and verify paradigm, and study the complexity of solving search
More informationReview of unsolvability
Review of unsolvability L L H To prove unsolvability: show a reduction. To prove solvability: show an algorithm. Unsolvable problems (main insight) Turing machine (algorithm) properties Pattern matching
More information6.5.3 An NPcomplete domino game
26 Chapter 6. Complexity Theory 3SAT NP. We know from Theorem 6.5.7 that this is true. A P 3SAT, for every language A NP. Hence, we have to show this for languages A such as kcolor, HC, SOS, NPrim, KS,
More informationRecap DFA,NFA, DTM. Slides by Prof. Debasis Mitra, FIT.
Recap DFA,NFA, DTM Slides by Prof. Debasis Mitra, FIT. 1 Formal Language Finite set of alphabets Σ: e.g., {0, 1}, {a, b, c}, { {, } } Language L is a subset of strings on Σ, e.g., {00, 110, 01} a finite
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 informationIV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University
IV. Turing Machine Yuxi Fu BASICS, Shanghai Jiao Tong University Alan Turing Alan Turing (23Jun.19127Jun.1954), an English student of Church, introduced a machine model for effective calculation in On
More informationCSCC63 Worksheet Turing Machines
1 An Example CSCC63 Worksheet Turing Machines Goal. Design a turing machine, M that accepts only strings of the form {w#w w {0, 1} }. Idea. Describe in words how the machine would work. Read first symbol
More informationTuring machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage?
Turing machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage? What is the most powerful of automata? In this lecture we will introduce
More informationGriffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 90
Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 90 Turing Machines Now for a machine model of much greater power.
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F}  Σ = Symbols  Q = States  q 0 = Initial State  F = Accepting States
More informationThe Class NP. NP is the problems that can be solved in polynomial time by a nondeterministic machine.
The Class NP NP is the problems that can be solved in polynomial time by a nondeterministic machine. NP The time taken by nondeterministic TM is the length of the longest branch. The collection of all
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 informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationSpace Complexity. The space complexity of a program is how much memory it uses.
Space Complexity The space complexity of a program is how much memory it uses. Measuring Space When we compute the space used by a TM, we do not count the input (think of input as readonly). We say that
More informationThe CookLevin Theorem
An Exposition Sandip Sinha Anamay Chaturvedi Indian Institute of Science, Bangalore 14th November 14 Introduction Deciding a Language Let L {0, 1} be a language, and let M be a Turing machine. We say M
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 informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 13 CHAPTER 4 TURING MACHINES 1. The definition of Turing machine 2. Computing with Turing machines 3. Extensions of 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 informationComputational complexity
COMS11700 Computational complexity Department of Computer Science, University of Bristol Bristol, UK 2 May 2014 COMS11700: Computational complexity Slide 1/23 Introduction If we can prove that a language
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 informationOn the Computational Hardness of Graph Coloring
On the Computational Hardness of Graph Coloring Steven Rutherford June 3, 2011 Contents 1 Introduction 2 2 Turing Machine 2 3 Complexity Classes 3 4 Polynomial Time (P) 4 4.1 COLOREDGRAPH...........................
More informationComputable Functions
Computable Functions Part I: Non Computable Functions Computable and Partially Computable Functions Computable Function Exists a Turing Machine M  M Halts on All Input  M(x) = f (x) Partially Computable
More informationCOMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
More informationTheory of Computation
Theory of Computation Unit 46: Turing Machines and Computability Decidability and Encoding Turing Machines Complexity and NP Completeness Syedur Rahman syedurrahman@gmail.com Turing Machines Q The set
More informationTuring Machines. Chapter 17
Turing Machines Chapter 17 Languages and Machines SD D ContextFree Languages Regular Languages reg exps FSMs cfgs PDAs unrestricted grammars Turing Machines Grammars, SD Languages, and Turing Machines
More informationCS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)
CS537 Theory of Computation Lecture : Computability Theory I (Turing Machine) Objectives Introduce the Turing Machine (TM)? Proposed by Alan Turing in 936 finitestate control + infinitely long tape A
More informationTuring Machines. The Language Hierarchy. ContextFree Languages. Regular Languages. Courtesy Costas Busch  RPI 1
Turing Machines a n b n c The anguage Hierarchy n? ww? ContextFree anguages a n b n egular anguages a * a *b* ww Courtesy Costas Busch  PI a n b n c n Turing Machines anguages accepted by Turing Machines
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 informationP is the class of problems for which there are algorithms that solve the problem in time O(n k ) for some constant k.
Complexity Theory Problems are divided into complexity classes. Informally: So far in this course, almost all algorithms had polynomial running time, i.e., on inputs of size n, worstcase running time
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is  you
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationLecture notes on Turing machines
Lecture notes on Turing machines Ivano Ciardelli 1 Introduction Turing machines, introduced by Alan Turing in 1936, are one of the earliest and perhaps the best known model of computation. The importance
More informationCSCI3390Lecture 14: The class NP
CSCI3390Lecture 14: The class NP 1 Problems and Witnesses All of the decision problems described below have the form: Is there a solution to X? where X is the given problem instance. If the instance is
More informationCP405 Theory of Computation
CP405 Theory of Computation BB(3) q 0 q 1 q 2 0 q 1 1R q 2 0R q 2 1L 1 H1R q 1 1R q 0 1L Growing Fast BB(3) = 6 BB(4) = 13 BB(5) = 4098 BB(6) = 3.515 x 10 18267 (known) (known) (possible) (possible) Language:
More informationTURING MAHINES
15453 TURING MAHINES TURING MACHINE FINITE STATE q 10 CONTROL AI N P U T INFINITE TAPE read write move 0 0, R, R q accept, R q reject 0 0, R 0 0, R, L read write move 0 0, R, R q accept, R 0 0, R 0 0,
More informationAutomata & languages. A primer on the Theory of Computation. Laurent Vanbever. ETH Zürich (DITET) October,
Automata & languages A primer on the Theory of Computation Laurent Vanbever www.vanbever.eu ETH Zürich (DITET) October, 19 2017 Part 5 out of 5 Last week was all about ContextFree Languages ContextFree
More informationChapter 2 : Time complexity
Dr. Abhijit Das, Chapter 2 : Time complexity In this chapter we study some basic results on the time complexities of computational problems. concentrate our attention mostly on polynomial time complexities,
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 informationCOMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE
Volume 3, No. 5, May 2012 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Tirtharaj Dash
More informationComputational Complexity. IE 496 Lecture 6. Dr. Ted Ralphs
Computational Complexity IE 496 Lecture 6 Dr. Ted Ralphs IE496 Lecture 6 1 Reading for This Lecture N&W Sections I.5.1 and I.5.2 Wolsey Chapter 6 Kozen Lectures 2125 IE496 Lecture 6 2 Introduction to
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationCS5371 Theory of Computation. Lecture 10: Computability Theory I (Turing Machine)
CS537 Theory of Computation Lecture : Computability Theory I (Turing Machine) Objectives Introduce the Turing Machine (TM) Proposed by Alan Turing in 936 finitestate control + infinitely long tape A stronger
More informationArtificial Intelligence. 3 Problem Complexity. Prof. Dr. Jana Koehler Fall 2016 HSLU  JK
Artificial Intelligence 3 Problem Complexity Prof. Dr. Jana Koehler Fall 2016 Agenda Computability and Turing Machines Tractable and Intractable Problems P vs. NP Decision Problems Optimization problems
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6tuple M = (Q, Σ, Γ, δ, q 0,
More informationECE 695 Numerical Simulations Lecture 2: Computability and NPhardness. Prof. Peter Bermel January 11, 2017
ECE 695 Numerical Simulations Lecture 2: Computability and NPhardness Prof. Peter Bermel January 11, 2017 Outline Overview Definitions Computing Machines ChurchTuring Thesis Polynomial Time (Class P)
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 14, 2014 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationNP, polynomialtime mapping reductions, and NPcompleteness
NP, polynomialtime mapping reductions, and NPcompleteness In the previous lecture we discussed deterministic time complexity, along with the timehierarchy theorem, and introduced two complexity classes:
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan August 30, Notes for Lecture 1
U.C. Berkeley CS278: Computational Complexity Handout N1 Professor Luca Trevisan August 30, 2004 Notes for Lecture 1 This course assumes CS170, or equivalent, as a prerequisite. We will assume that the
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15453 SPRING 2011 1 / 34 TURING MACHINESSYNOPSIS The most general model of computation Computations of a TM are described
More informationComputational Complexity
Computational Complexity Algorithm performance and difficulty of problems So far we have seen problems admitting fast algorithms flow problems, shortest path, spanning tree... and other problems for which
More informationMost General computer?
Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall
More informationEasy Shortcut Definitions
This version Mon Dec 12 2016 Easy Shortcut Definitions If you read and understand only this section, you ll understand P and NP. A language L is in the class P if there is some constant k and some machine
More informationCMPT307: Complexity Classes: P and N P Week 131
CMPT307: Complexity Classes: P and N P Week 131 Xian Qiu Simon Fraser University xianq@sfu.ca Strings and Languages an alphabet Σ is a finite set of symbols {0, 1}, {T, F}, {a, b,..., z}, N a string x
More informationCS4026 Formal Models of Computation
CS4026 Formal Models of Computation Turing Machines Turing Machines Abstract but accurate model of computers Proposed by Alan Turing in 1936 There weren t computers back then! Turing s motivation: find
More informationNPCompleteness. Algorithmique Fall semester 2011/12
NPCompleteness Algorithmique Fall semester 2011/12 1 What is an Algorithm? We haven t really answered this question in this course. Informally, an algorithm is a stepbystep procedure for computing a
More informationQuantum Computing Lecture 8. Quantum Automata and Complexity
Quantum Computing Lecture 8 Quantum Automata and Complexity Maris Ozols Computational models and complexity Shor s algorithm solves, in polynomial time, a problem for which no classical polynomial time
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 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 informationCS154, Lecture 17: conp, Oracles again, Space Complexity
CS154, Lecture 17: conp, Oracles again, Space Complexity 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
More informationComputational Complexity
Computational Complexity Problems, instances and algorithms Running time vs. computational complexity General description of the theory of NPcompleteness Problem samples 1 Computational Complexity What
More informationSpring Lecture 21 NPComplete Problems
CISC 320 Introduction to Algorithms Spring 2014 Lecture 21 NPComplete Problems 1 We discuss some hard problems: how hard? (computational complexity) what makes them hard? any solutions? Definitions Decision
More informationBBM402Lecture 11: The Class NP
BBM402Lecture 11: The Class NP Lecturer: Lale Özkahya Resources for the presentation: http://ocw.mit.edu/courses/electricalengineeringandcomputerscience/6045jautomatacomputabilityandcomplexityspring2011/syllabus/
More informationWeek 2: Defining Computation
Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way
More informationSample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols
Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols The purpose of this document is to illustrate what a completed project should look like. I have chosen a problem that
More informationECS 120 Lesson 15 Turing Machines, Pt. 1
ECS 120 Lesson 15 Turing Machines, Pt. 1 Oliver Kreylos Wednesday, May 2nd, 2001 Before we can start investigating the really interesting problems in theoretical computer science, we have to introduce
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Theory of Computation. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationCS294: Pseudorandomness and Combinatorial Constructions September 13, Notes for Lecture 5
UC Berkeley Handout N5 CS94: Pseudorandomness and Combinatorial Constructions September 3, 005 Professor Luca Trevisan Scribe: Gatis Midrijanis Notes for Lecture 5 In the few lectures we are going to look
More informationCMSC 441: Algorithms. NP Completeness
CMSC 441: Algorithms NP Completeness Intractable & Tractable Problems Intractable problems: As they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard
More informationCSCI 1590 Intro to Computational Complexity
CSCI 59 Intro to Computational Complexity Overview of the Course John E. Savage Brown University January 2, 29 John E. Savage (Brown University) CSCI 59 Intro to Computational Complexity January 2, 29
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationLTCC Course: Graph Theory 2017/18 3: Complexity and Algorithms
LTCC Course: Graph Theory 2017/18 3: Complexity and Algorithms Peter Allen 5 March 2018 The graph theory textbooks do little or no algorithms, so for this lecture we have to go somewhere else. The default
More informationCHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY. E. Amaldi Foundations of Operations Research Politecnico di Milano 1
CHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Goal: Evaluate the computational requirements (this course s focus: time) to solve
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 informationUmans Complexity Theory Lectures
Complexity Theory Umans Complexity Theory Lectures Lecture 1a: Problems and Languages Classify problems according to the computational resources required running time storage space parallelism randomness
More informationIn complexity theory, algorithms and problems are classified by the growth order of computation time as a function of instance size.
10 2.2. CLASSES OF COMPUTATIONAL COMPLEXITY An optimization problem is defined as a class of similar problems with different input parameters. Each individual case with fixed parameter values is called
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationNonemptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
More informationCSCI3390Assignment 2 Solutions
CSCI3390Assignment 2 Solutions due February 3, 2016 1 TMs for Deciding Languages Write the specification of a Turing machine recognizing one of the following three languages. Do one of these problems.
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 informationAlgorithmic probability, Part 1 of n. A presentation to the Maths Study Group at London South Bank University 09/09/2015
Algorithmic probability, Part 1 of n A presentation to the Maths Study Group at London South Bank University 09/09/2015 Motivation Effective clustering the partitioning of a collection of objects such
More information1. Introduction Recap
1. Introduction Recap 1. Tractable and intractable problems polynomialboundness: O(n k ) 2. NPcomplete problems informal definition 3. Examples of P vs. NP difference may appear only slightly 4. Optimization
More informationMidterm Exam 2 CS 341: Foundations of Computer Science II Fall 2018, facetoface day section Prof. Marvin K. Nakayama
Midterm Exam 2 CS 341: Foundations of Computer Science II Fall 2018, facetoface day section Prof. Marvin K. Nakayama Print family (or last) name: Print given (or first) name: I have read and understand
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More informationLecture 19: Finish NPCompleteness, conp and Friends
6.045 Lecture 19: Finish NPCompleteness, conp and Friends 1 Polynomial Time Reducibility f : Σ* Σ* is a polynomial time computable function if there is a polytime Turing machine M that on every input
More informationCS3719 Theory of Computation and Algorithms
CS3719 Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components:  problem description  computational tool  analysis
More informationChapter 7 Turing Machines
Chapter 7 Turing Machines Copyright 2011 The McGrawHill Companies, Inc. Permission required for reproduction or display. 1 A General Model of Computation Both finite automata and pushdown automata are
More informationNonApproximability Results (2 nd part) 1/19
NonApproximability Results (2 nd part) 1/19 Summary  The PCP theorem  Application: Nonapproximability of MAXIMUM 3SAT 2/19 Non deterministic TM  A TM where it is possible to associate more than one
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationMidterm Exam 2 CS 341: Foundations of Computer Science II Fall 2016, facetoface day section Prof. Marvin K. Nakayama
Midterm Exam 2 CS 341: Foundations of Computer Science II Fall 2016, facetoface day section Prof. Marvin K. Nakayama Print family (or last) name: Print given (or first) name: I have read and understand
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 informationA Lower Bound for Boolean Satisfiability on Turing Machines
A Lower Bound for Boolean Satisfiability on Turing Machines arxiv:1406.5970v1 [cs.cc] 23 Jun 2014 Samuel C. Hsieh Computer Science Department, Ball State University March 16, 2018 Abstract We establish
More information