Lecture 23 Space Complexity of DTM. Space Space M (x) = # of cell that M visits on the work (storage) tapes during the computation on input x. If M is.

Slides:



Advertisements
Similar presentations
Algorithms Sipser 3.3 (pages ). CS 311 Fall Computability Hilbert's Tenth Problem: Find a process according to which it can be determined.
Advertisements

Part VI NP-Hardness. Lecture 23 Whats NP? Hard Problems.
Resource-Bounded Computation
Space complexity [AB 4]. 2 Input/Work/Output TM Output.
Lecture 3 Universal TM. Code of a DTM Consider a one-tape DTM M = (Q, Σ, Γ, δ, s). It can be encoded as follows: First, encode each state, each direction,
Lecture 16 Deterministic Turing Machine (DTM) Finite Control tape head.
1 Savitch and Immerman- Szelepcsènyi Theorems. 2 Space Compression  For every k-tape S(n) space bounded offline (with a separate read-only input tape)
Lecture 24 Time and Space of NTM. Time For a NDM M and an input x, Time M (x) = the minimum # of moves leading to accepting x if x ε L(M) = infinity if.
Everything you always wanted to know about theoretical computer science (but were afraid to ask) Dimitris Achlioptas Microsoft Research.
Umans Complexity Theory Lectures Lecture 2a: Reductions & Completeness.
Nathan Brunelle Department of Computer Science University of Virginia Theory of Computation CS3102 – Spring 2014 A tale.
Complexity 12-1 Complexity Andrei Bulatov Non-Deterministic Space.
Complexity 15-1 Complexity Andrei Bulatov Hierarchy Theorem.
Complexity 11-1 Complexity Andrei Bulatov Space Complexity.
Computability and Complexity 22-1 Computability and Complexity Andrei Bulatov Hierarchy Theorem.
Complexity 13-1 Complexity Andrei Bulatov Hierarchy Theorem.
1 L is in NP means: There is a language L’ in P and a polynomial p so that L 1 · L 2 means: For some polynomial time computable map r : 8 x: x 2 L 1 iff.
P and NP Sipser (pages ). CS 311 Fall Polynomial time P = ∪ k TIME(n k ) … P = ∪ k TIME(n k ) … TIME(n 3 ) TIME(n 2 ) TIME(n)
P, NP, PS, and NPS By Muhannad Harrim. Class P P is the complexity class containing decision problems which can be solved by a Deterministic Turing machine.
Computability and Complexity 7-1 Computability and Complexity Andrei Bulatov Recursion Theorem.
Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Class NL.
CS151 Complexity Theory Lecture 2 April 3, Time and Space A motivating question: –Boolean formula with n nodes –evaluate using O(log n) space?
Fall 2006Costas Busch - RPI1 The Chomsky Hierarchy.
Umans Complexity Theory Lectures Lecture 2c: EXP Complete Problem: Padding and succinctness.
CS 310 – Fall 2006 Pacific University CS310 Complexity Section 7.1 November 27, 2006.
CS151 Complexity Theory Lecture 2 April 1, CS151 Lecture 22 Time and Space A motivating question: –Boolean formula with n nodes –evaluate using.
Lecture 18 Various TMs. Allow the head not move Theorem. If the head is allowed to stay at the cell in each move, then every function computed by the.
Definition: Let M be a deterministic Turing Machine that halts on all inputs. Space Complexity of M is the function f:N  N, where f(n) is the maximum.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
Ding-Zhu Du Office: ECSS 3-611, M 3:15-4:30 Lecture: ECSS 2.311, MW 12:30-1:45.
Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink.
February 18, 2015CS21 Lecture 181 CS21 Decidability and Tractability Lecture 18 February 18, 2015.
Theory of Computing Lecture 21 MAS 714 Hartmut Klauck.
::ICS 804:: Theory of Computation - Ibrahim Otieno SCI/ICT Building Rm. G15.
CS848: Topics in Databases: Foundations of Query Optimization Topics covered  Review of complexity.
1 How to establish NP-hardness Lemma: If L 1 is NP-hard and L 1 ≤ L 2 then L 2 is NP-hard.
Hierarchy theorems Section 9.1 Giorgi Japaridze Theory of Computability.
Lecture 22. Time of DTM. Time of DTM Time M (x) = # of moves that DTM M takes on input x. Time M (x) < infinity iff x ε L(M).
Umans Complexity Theory Lectures Lecture 1c: Robust Time & Space Classes.
Fall 2013 CMU CS Computational Complexity Lecture 2 Diagonalization, 9/12/2013.
Lecture 4 Hierarchy Theorem. Space Hierarchy Theorem.
Umans Complexity Theory Lectures Lecture 1b: Turing Machines & Halting Problem.
Lecture 2 Time and Space of DTM. Time of DTM Time M (x) = # of moves that DTM M takes on input x. Time M (x) < infinity iff x ε L(M).
Theory of Computational Complexity Yuji Ishikawa Avis lab. M1.
Recall last lecture and Nondeterministic TMs Ola Svensson.
The Church-Turing Thesis
 2005 SDU Lecture14 Mapping Reducibility, Complexity.
Design and Analysis of Approximation Algorithms
Lecture 1-2 Time and Space of DTM
Lecture 2-6 Polynomial Time Hierarchy
Part VI NP-Hardness.
Turing Machines Space bounds Reductions Complexity classes
Umans Complexity Theory Lectures
HIERARCHY THEOREMS Hu Rui Prof. Takahashi laboratory
CSE322 The Chomsky Hierarchy
CS21 Decidability and Tractability
CS154, Lecture 12: Time Complexity
Part II Theory of Nondeterministic Computation
CS21 Decidability and Tractability
CS21 Decidability and Tractability
Lecture 21 More Approximation Algorithms
CS21 Decidability and Tractability
DSPACE Slides By: Alexander Eskin, Ilya Berdichevsky
CS6382 Theory of Computation
The Chomsky Hierarchy Costas Busch - LSU.
Intro to Theory of Computation
Intro to Theory of Computation
Lecture 1-2 Time and Space of DTM
Presentation transcript:

Lecture 23 Space Complexity of DTM

Space Space M (x) = # of cell that M visits on the work (storage) tapes during the computation on input x. If M is a multitape DTM, then the work tapes do not include the input tape and the write-only output tape.

Space Bound A DTM is said to have a space bound s(n) if for any input x with |x| < n, SpaceM(x) < max{1, s(n)}.

Time and Space For any DTM with k work tapes, Space M (x) < K (Time M (x) + 1)

Complexity Classes A language L has a space complexity s(n) if it is accepted by a multitape with write- only output tape DTM with space bound s(n). DSPACE(s(n)) = {L | L has space complexity s(n)}

Tape Compression Theorem For any function s(n) and any constant c > 0, DSPACE(s(n)) = DSPACE(c·s(n))

Model Independent Classes P = U c>0 DTIME(n ) EXP = U c > 0 DTIME(2 ) EXPOLY = U c > 0 DTIME(2 ) PSPACE = U c > 0 DSPACE(n ) c cn n c c

Extended Church-Turing Thesis A function computable in polynomial time in any reasonable computational model using a reasonable time complexity measure is computable by a DTM in polynomial time.

P PSPACE

PSPACE EXPOLY

A, B ε P imply A U B ε P

A, B ε P imply AB ε P

L ε P implies L* ε P

All regular sets belong to P

Hierachy Theorem

Space-constructible function s(n) is fully space-constructible if there exists a DTM M such that for sufficiently large n and any input x with |x|=n, Space M (x) = s(n).

Space Hierarchy If s 2 (n) is a fully space-constructible function, s 1 (n)/s 2 (n) → 0 as n → infinity, s 1 (n) > log n, then DSPACE(s2(n)) DSPACE(s1(n)) ≠ Φ

Time-constructible function t(n) is fully time-constructible if there exists a DTM such that for sufficiently large n and any input x with |x|=n, Time M (x) = t(n).

Time Hierarchy If t 1 (n) > n+1, t 2 (n) is fully time-constructible, t 1 (n) log t 1 (n) /t 2 (n) → 0 as n → infinity, then DTIME(t 2 (n)) DTIME(t 1 (n)) ≠ Φ

P EXP

EXP ≠ PSAPACE