> The theory of how much resources are required to compute & solve problems that are computable
- [[P vs. NP]]
- [[P Problems]]
- [[NP Problems]]
- [[NP Complete Problems]]
- [[NP Hard Problems]]
- [[Reductions]]
- [[Search Problems]]
- [[Asymptotic Analysis]]
- some problems while technically [[Computability Theory|Computable]], might take the lifetime of the universe to solve
- so we must study the complexity of problems as their inputs scale
https://cs.stackexchange.com/questions/47383/what-is-the-difference-between-complexity-theory-and-computability-theory