NPSPACE is a type of complexity class containing decision problems that can be solved by a non-deterministic Turing machine using a polynomial amount of memory space Resources https://en.wikipedia.org/w/index.php?title=NPSPACE&redirect=no