It is unknown whether $P\subseteq CSL$ or $P\not\subseteq CSL$, where

  • $P$ is the set of all languages decidable in polynomial time on a deterministic Turing machine, and
  • $CSL$ is the class of context-sensitive languages, known to be equivalent to $NSPACE(O(n))$, the languages decided by linear-bounded automata.

For many open questions, there is a tendency towards one answer (a la "most experts believe that $P\neq NP$"). Is there something like this for this question?

In particular, would either answer have unexpected consequences? I can only see expected (but unproven) consequences:

  • If $P\subseteq CSL$, then $P\subseteq NSPACE(O(n))\subsetneq NSPACE(O(n^2))$ (space hierarchy theorem), hence $P\subsetneq PSpace$.
  • If $P\not\subseteq CSL$, then there is a language $l\in P\setminus NSPACE(O(n))$ and therefore $l\in P\setminus NL$, hence $NL\subsetneq P$.

(Acknowledgement: The second consequence of these two was pointed out by Yuval Filmus at https://cs.stackexchange.com/questions/69614/)


1 Answer 1


If $\mathrm{P\subseteq CSL}$, then $\mathrm{P\subseteq DSPACE}(n^2)$. By a padding argument, this implies $$\mathrm{DTIME}(t(n))\subseteq\mathrm{DSPACE}\bigl(t(n)^\epsilon\bigr)$$ for every superpolynomial well-behaved function $t(n)$ and every $\epsilon>0$. I believe such a strong advantage of space over time is not expected to be true. The best currently known result in this direction is $$\mathrm{DTIME}(t(n))\subseteq\mathrm{DSPACE}(t(n)/\log t(n)),$$ due to Hopcroft, Paul, and Valiant.

  • $\begingroup$ Thanks, I have accepted this answer now, although, given the nature of this question, further replies would of course still be welcome. $\endgroup$
    – mak
    Commented Feb 4, 2017 at 20:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.