All set of polynomial questions which can be solved by a turing machine using a polynomial amount of space:
(a) PSPACE
(b) NPSPACE
(c) EXPSPACE
(d) None of the mentioned
This question was addressed to me in exam.
I need to ask this question from PSPACE topic in division Other Classes Of Problems of Automata Theory