Recursion theory

Ackermann function Alan Turing Algorithm Alonzo Church Arithmetical hierarchy Calculus of constructions Church-Rosser theorem Church-Turing thesis Combinatory logic Complexity class Complexity classes P and NP Computability theory Computable function computation Computational complexity theory Cook's theorem Decidability (logic) Decidable language Decision problem Definable real number Diophantine set Effective results in number theory Emil Post Entscheidungsproblem Exponential hierarchy Exponential time Halting problem Haskell Curry Herbrand Universe Hypercomputation Jacques Herbrand Kleene's recursion theorem Lambda calculus List of complexity classes Markov algorithm Matiyasevich's theorem Mu operator Natural proof NP-complete Oracle machine Polynomial hierarchy Polynomial time Post correspondence problem Post's theorem Presburger arithmetic Primitive recursive function Recursion Recursively enumerable language Recursively enumerable set Rice's theorem Rózsa Péter Space hierarchy theorem Stephen Cole Kleene Subrecursion theory Time hierarchy theorem Turing degree Turing machine Undecidable language Word problem for groups