**constructive mathematics**, **realizability**, **computability**

propositions as types, proofs as programs, computational trinitarianism

**Computational complexity theory** is the study of how much and how many resources are required to perform computations. Unlike other systems theories, computational complexity theory is purely mathematical and focuses on analysis of formal logic and abstract machines.

Historically, computational complexity theory arose from questions in computability theory and cryptography. In computability theory, we wanted to know what might be uncomputable relative to certain models of computation. In cryptography, we wanted to know which ciphers could be broken for a given amount of computational resources.

Today, the main focus of computational complexity theory is analysis of the complexity classes P and NP. Their relationship determines which of Impagliazzo's five worlds? is physical reality.

Additionally, descriptive complexity theory is an active research programme which characterizes complexity classes via formal logic rather than abstract machines.

- Wikipedia,
*Computational complexity theory* - Wikipedia,
*P vs NP problem*

Discussion of complexity classes via linear logic:

- Pierre Boudes, Damiano Mazza, Lorenzo Tortora de Falco,
*An Abstract Approach to Stratification in Linear Logic*(arXiv:1206.6504)

Discussion for quantum computation and quantum supremacy:

- Scott Aaronson, Lijie Chen,
*Complexity-Theoretic Foundations of Quantum Supremacy Experiments*, CCC ‘17: Proceedings of the 32nd Computational Complexity Conference (2017)**22**1–67 [arXiv:1612.05903, doi;10.5555/3135595.3135617]

Last revised on August 28, 2022 at 09:15:06. See the history of this page for a list of all contributions to it.