Get it on Google Play
New! Download Unionpedia on your Androidâ„¢ device!
Faster access than browser!

Truth-table reduction

+ Save concept

In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another. [1]

8 relations: Boolean function, Computability theory, Computable function, Hartley Rogers Jr., Natural number, Oracle machine, Reduction (complexity), Turing reduction.

Boolean function

In mathematics and logic, a (finitary) Boolean function (or switching function) is a function of the form ƒ: Bk → B, where B.

New!!: Truth-table reduction and Boolean function · See more »

Computability theory

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.

New!!: Truth-table reduction and Computability theory · See more »

Computable function

Computable functions are the basic objects of study in computability theory.

New!!: Truth-table reduction and Computable function · See more »

Hartley Rogers Jr.

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.

New!!: Truth-table reduction and Hartley Rogers Jr. · See more »

Natural number

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").

New!!: Truth-table reduction and Natural number · See more »

Oracle machine

In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems.

New!!: Truth-table reduction and Oracle machine · See more »

Reduction (complexity)

In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem.

New!!: Truth-table reduction and Reduction (complexity) · See more »

Turing reduction

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).

New!!: Truth-table reduction and Turing reduction · See more »

Redirects here:

Bounded Turing reduction, Truth table reduction, Tt-reduction, Weak truth table reduction, Wtt reduction.


[1] https://en.wikipedia.org/wiki/Truth-table_reduction

Hey! We are on Facebook now! »