I'm having trouble showing that $P\neq R$. Obviously $P\subseteq R$, but is there a decidable language which is definitely not (under all answers to open questions s.t. $P=NP$ or $NP=PSPACE$) in $P$ ?
Asked
Active
Viewed 1,564 times
0
-
1Please don't ask a question in the title whose answer is the exact opposite of question in the body ("No" and "Yes", respectively). – David Richerby Jun 23 '16 at 08:32
-
Possible duplicate. This one has some examples, too. – Raphael Jun 23 '16 at 09:24
-
In reply to @adrianN, I found both questions by googling "problems not in P" and following some links. – Raphael Jun 23 '16 at 09:26
1 Answers
7
Yes, there are decidable languages that are definitely not in P. The time hierarchy theorem says that P$\,\neq\,$EXP, so P$\,\neq\,$R, independently of the P vs NP problem. Any EXP-complete problem is definitely not in P: for example determining whether white has a winning strategy from a position in generalized chess ("generalized" in the sense of allowing a board of any dimensions, with any arrangement of any number of pieces, but otherwise following all the rules of standard chess).
David Richerby
- 81,689
- 26
- 141
- 235