Unformatted text preview: w ∈ L } . Then, since for every x ∈ L ,  x  =  w 1  w  2  >  w  2 , L ∈ space ( n ). By P = space ( n ) there exists a TM T that decides L in O ( n c ) time, and thus a TM T that decides L in time O ( n 2 c ). So L ∈ P = space ( n ), therefore space ( n 2 ) ⊆ space ( n ), contradicting the Space Hierarchy Theorem. 1...
View
Full Document
 Spring '08
 Sturtivant,C
 Logic, Space, Computational complexity theory, Closure

Click to edit the document details