👉 Should computing, also known as should computation or should computation theory, is a theoretical framework that explores the computational resources required to solve problems that are inherently difficult or impossible for classical computers. It focuses on identifying the minimal resources—such as time, space, and computational power—needed to solve problems within specific classes, like NP-complete or PSPACE-complete. By abstracting away from the practical details of algorithms and focusing on theoretical limits, should computing aims to understand the fundamental boundaries of computation, helping to classify problems based on their computational difficulty and guiding the development of more efficient algorithms or even proving that certain problems are fundamentally intractable.
