In mathematics and logic, a (finitary) Boolean function (or switching function) is a function of the form ƒ: Bk → B, where B.
Computability theory, also known as recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees.
Computable functions are the basic objects of study in computability theory.
Hartley Rogers Jr. (1926–2015) was a mathematician who worked in recursion theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology.
In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").
In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems.
In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem.
In computability theory, a Turing reduction from a problem A to a problem B, is a reduction which solves A, assuming the solution to B is already known (Rogers 1967, Soare 1987).