Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology

Computability theory

Church–Turing thesis
Thesis on the nature of computability
Combinatory logic
Logical formalism using combinators instead of variables
Computability theory
Branch of mathematical logic, computer science, and the theory of computation studying computable functions and Turing degrees
Computable function
Mathematical function that can be computed by a program
Computable set
Set where an algorithm can take a number as an input and can decide whether the number belongs to the set
Computably enumerable set
Mathematical logic concept
Computably inseparable
Concept in computability theory
Decision problem
Yes/no problem in computer science
Entscheidungsproblem
Impossible task in computing
General recursive function
One of several equivalent definitions of a computable function
Gödel numbering
Function in mathematical logic
Gödel's incompleteness theorems
Limitative results in mathematical logic
Halting problem
Problem of determining whether a given program will finish running or continue forever
Lambda calculus
Formal mathematical logic system centered on function abstractions and applications
Many-one reduction
Type of Turing reduction
Model of computation
Mathematical model describing how an output of a function is computed given an input
Oracle machine
Abstract machine used to study decision problems
Primitive recursive function
Function that can be computed with loops of bounded length
Rice's theorem
Theorem in computability theory
Turing degree
Measurement for the level of algorithmic unsolvability of a set
Turing machine
Computation model defining an abstract machine
Turing reduction
Concept in computability theory
Turing's proof
Proof by Alan Turing
Universal Turing machine
Type of Turing machine
UTM theorem
Affirms the existence of a computable universal function
μ operator
Concept in computability theory