Communication
Install
Faster access than browser!

New! »

Truth-table reduction

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

Boolean function

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

Computability theory

Computability theory, also called 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 function

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

Hartley Rogers, Jr.

Hartley Rogers, Jr. was a mathematician who worked in recursion theory, and was a professor in the Mathematics Department of the Massachusetts Institute of Technology.

Natural number

In mathematics, the natural numbers (sometimes called the whole numbers): "whole number An integer, though sometimes it is taken to mean only non-negative integers, or just the positive integers." give definitions of "whole number" under several headwords: INTEGER … Syn. whole number.

Oracle machine

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

Reduction (complexity)

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

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

References

Hey! We are on Facebook now! »