Computational Complexity
A theoretical field that studies the intrinsic difficulty of computational problems, classifying problems by how hard they are to solve. NP-hard problems are those for which no exact polynomial-time algorithm is known.
Timeline (last 90 days)
Computational complexity studies how the resources required to solve a problem (usually time and space) grow with the size of the problem.
Using computational complexity to constrain the modeling of natural phenomena means: if a natural process requires exponential time to simulate, then whether that process itself actually operates in this way in reality is open to doubt.
Although the Nash equilibrium is elegant as a solution concept, its computational difficulty undermines its universality as a general mechanism.
Scott Aaronson is one of the most influential theorists in the fields of quantum computing and computational complexity.
The Aaronson Oracle connects three fields: computational complexity, cryptography, and cognitive science.
All Facts (5)
Computational complexity studies how the resources required to solve a problem (usually time and space) grow with the size of the problem.
50%UnverifiedUsing computational complexity to constrain the modeling of natural phenomena means: if a natural process requires exponential time to simulate, then whether that process itself actually operates in this way in reality is open to doubt.
50%UnverifiedAlthough the Nash equilibrium is elegant as a solution concept, its computational difficulty undermines its universality as a general mechanism.
50%UnverifiedScott Aaronson is one of the most influential theorists in the fields of quantum computing and computational complexity.
50%UnverifiedThe Aaronson Oracle connects three fields: computational complexity, cryptography, and cognitive science.
50%