Describe the hierarchy of fundamental complexity classes including P, NP, PSPACE, and EXPTIME. Explain the resources (time and space) that define each class. Discuss the known inclusion relationships between these classes, such as P being a subset of NP, and mention which inclusions are still open problems in theoretical computer science.