# Computational complexity

> (In Computer science) Computational complexity. Whereas computability theory asks whether a problem can be computed, computational complexity theory asks how efficiently computable problems can be computed.

(In [Computer science](https://wiki.g15e.com/en/pages/Computer%20science.txt)) Computational complexity. Whereas <computability theory> asks whether a problem can be computed, computational complexity theory asks how efficiently computable problems can be computed.

## Articles

- https://www.quantamagazine.org/complexity-theorys-50-year-journey-to-the-limits-of-knowledge-20230817/

## See also

- [Asymptotic notation](https://wiki.g15e.com/pages/Asymptotic%20notation.txt)