In the realm of computational complexity theory, particularly when examining space complexity classes, the relationship between PSPACE and NP is of significant interest. To address the question directly: yes, there are problems in PSPACE for which there is no known NP algorithm. This assertion is rooted in the definitions and relationships between these complexity classes.