User:Williamdemeo/Books/Complexity, Computability, and Types

Complexity, Computability, and Types

 * Complexity Theory
 * Computational complexity theory
 * Time complexity
 * P versus NP problem
 * Effective method
 * P (complexity)
 * NP (complexity)
 * Co-NP
 * NP-complete
 * NP-hard
 * Karp's 21 NP-complete problems
 * List of NP-complete problems
 * Decision problem
 * Undecidable problem
 * Counting problem (complexity)
 * Search problem
 * Reduction (complexity)
 * Many-one reduction
 * Boolean satisfiability problem
 * Subset sum problem


 * Computability Theory
 * First-order logic
 * Soundness
 * Completeness (logic)
 * Consistency
 * Peano axioms
 * Computability theory
 * Turing machine
 * Halting problem
 * Computable function
 * Primitive recursive arithmetic
 * Primitive recursive function
 * Primitive recursive functional
 * Turing completeness
 * Church-Turing thesis
 * Church–Turing thesis
 * Gödel's completeness theorem
 * Gödel's incompleteness theorems


 * Type Theory
 * Type theory
 * Intuitionistic type theory
 * Fixed-point combinator
 * Lambda calculus
 * Typed lambda calculus
 * Functional programming
 * Total functional programming
 * Dependent type
 * Curry-Howard correspondence
 * Corecursion
 * Algorithm characterizations


 * Appendix
 * Zermelo–Fraenkel set theory
 * Constructive set theory
 * Extensionality
 * Axiom of extensionality
 * Impredicativity
 * Intensional logic