constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
The complexity class of “Nondeterministic Polynomial time”-algorithms.
See also:
Created on November 27, 2022 at 17:36:39. See the history of this page for a list of all contributions to it.