-1

There are problems that can't be solved in polynomial time, but are there problems that can't be solved using polynomial space?

templatetypedef
  • 362,284
  • 104
  • 897
  • 1,065
Cauchy Schwarz
  • 747
  • 3
  • 10
  • 27
  • 3
    I'm voting to close this question as off-topic because it belongs on http://cs.stackexchange.com/ – Erick G. Hagstrom Jul 01 '16 at 19:40
  • You may be interested in this question on the related Computer Science site: http://cs.stackexchange.com/questions/30346/how-can-an-algorithm-have-exponential-space-complexity-but-polynomial-time-compl – Erick G. Hagstrom Jul 01 '16 at 19:47
  • https://en.wikipedia.org/wiki/PSPACE#Relation_among_other_classes – amit Jul 01 '16 at 19:48

1 Answers1

2

Yes. In the extreme case, there are problems like the halting problem that are undecidable, so they can't be solved in any amount of space. On a more practical level, there's the space hierarchy theorem which can be used to construct a problem that can be solved in space O(2n) but not space o(2n), ruling out polynomial-space solutions.

templatetypedef
  • 362,284
  • 104
  • 897
  • 1,065