You can solve a hard puzzle. You might need help from a friend. A friend can tell you things. You use those things to find the answer. It is like using a tool. Can you use a tool to help you?
Imagine you have a hard puzzle. You want to solve it. You can use a special tool to help. This tool knows the answers to other puzzles.
If you have this tool, you can solve your puzzle. You just ask the tool for help. This is called a reduction. It means one problem helps solve another.
A man named Alan Turing thought of this. He used a machine to show how it works.
Sometimes, the tool might take a long time. You might have to ask the tool many questions. But it still helps you find the truth.
This idea helps us understand how much work a computer does.
Imagine you have a very hard math puzzle. You want to solve it. You can use a special tool to help. This tool is like a helper that knows the answers to other puzzles.
In math, we call this a Turing reduction. It is a way to use one problem to solve another. If you have a way to solve problem B, you can use it to solve problem A. You just ask the helper for the answers to B as you work on A.
Alan Turing first described this idea in 1939. He used a special idea called an oracle machine. An oracle is like a magic helper that gives quick answers.
Sometimes, using the helper takes a lot of time. You might have to ask the helper many questions. If the helper works very fast, we call it a Cook reduction. Some ways of helping are even stronger. One way is called a many-one reduction. This is a stricter way to connect two problems. These ideas help us see how hard different problems really are.
Imagine you are trying to solve a very difficult math puzzle. You might not be able to do it alone. However, you could solve it if you had a special helper. This helper is like a magic book that knows all the answers to a different puzzle. In math, we call this a Turing reduction. It is a way to show that one problem is not harder than another. If you can solve problem B, you can use those answers to solve problem A. You simply use the answers from B as a tool to finish your work on A.
How does this work in practice? We imagine a machine that is trying to solve a problem. This machine can pause its work to ask a helper for information. This helper is called an oracle. The oracle gives an answer to a specific question instantly. The machine can ask the oracle many different questions. Each question helps the machine move one step closer to the final answer. Sometimes, this process takes a very long time. If the machine finishes its work quickly, we call it a Cook reduction.
Many smart people helped build these ideas. Alan Turing first wrote down the formal definition in 1939. He used the idea of oracle machines to explain it. Later, Stephen Kleene defined similar ideas in 1943 and 1952. He used a different way called recursive functions. In 1944, a mathematician named Emil Post used the name "Turing reducibility." These thinkers wanted to understand how different math problems relate to each other. Their work helps us group problems by how much effort they need.
There are many interesting facts about these connections. If two problems can solve each other, they are Turing equivalent. We call these groups of equal problems "Turing degrees." Every set is Turing equivalent to its own opposite. Also, any problem that is easy to solve can be reduced to any other problem. This is because an easy problem does not even need a helper to work. However, some problems are much harder than others. Some problems are so tough that they are called "Turing hard."
These ideas connect to how computers actually work. They help us see the limits of what machines can do. We use reductions to find out if a problem is truly impossible. Some reductions are even stricter than Turing reductions. For example, a many-one reduction is a very strong way to link two problems. It requires a very specific way of using the helper's answers. By studying these different levels, we learn how organized the world of math really is.
In the field of computability theory, a Turing reduction is a powerful way to compare the difficulty of two problems. It is a mathematical method used to show that one problem is no harder than another. If we have a decision problem, we can solve it by using an oracle machine. This machine acts as an algorithm that has access to a special subroutine. This subroutine is called an oracle, and it provides instant answers to a specific problem. By using these answers, the machine can solve its own problem in a finite number of steps.
The mechanism of a Turing reduction works through a process of querying. Imagine you are running an algorithm to solve problem A. During the process, your algorithm reaches a point where it needs information about problem B. Instead of solving B itself, the algorithm asks the oracle for the answer. This oracle acts as a perfect source of information for problem B. If a Turing reduction from A to B exists, then every algorithm for B can be used to build an algorithm for A. You simply take the algorithm for B and insert it wherever the oracle machine would have made a query. However, this process might take much longer than the original algorithms. The resulting process may require more time asymptotically than either the original algorithm for A or the oracle machine for B.
There are several different types of reductions that vary in their strictness. A Turing reduction where the oracle machine runs in polynomial time is called a Cook reduction. This is important for studying computational complexity. Other, more restrictive versions include many-one reductions. In a many-one reduction, an element is in set A if and only if its transformed version is in set B. There are also truth table reductions and weak truth table reductions. In a truth table reduction, the machine must present all its oracle queries at the same time. It then uses a Boolean function to turn those answers into a final result. A weak truth table reduction is a "bounded Turing" reduction. In this version, the use of the reduction is limited by a computable function.
The history of these ideas involves several key mathematicians. Alan Turing provided the first formal definition of relative computability in 1939. He described it using the concept of oracle machines. Later, Stephen Kleene developed an equivalent concept using recursive functions in 1943 and 1952. In 1944, Emil Post introduced the specific term "Turing reducibility." These thinkers were trying to understand how different sets of numbers relate to one another through computation. Their work laid the foundation for how we categorize the complexity of mathematical problems today.
We can use these reductions to group problems into specific categories. If two sets are Turing equivalent, it means they can be reduced to each other. We call these groups of equivalent sets "Turing degrees." The degree of a set is written as the symbol d. We can also identify sets that are "Turing hard" for a certain class. If a set is both Turing hard and belongs to that class, it is called "Turing complete." This concept is closely related to computational universality. A machine is a universal Turing machine if its halting problem is many-one complete for the set of recursively enumerable sets.
There are several fascinating properties of Turing reducibility. First, every set is Turing equivalent to its own complement. Second, any computable set is Turing reducible to every other set. This is because a computable set can be solved without any oracle at all. The relationship is also transitive. This means if A is reducible to B, and B is reducible to C, then A is reducible to C. However, the relationship is not a total order. There are pairs of sets where A cannot be reduced to B, and B cannot be reduced to A. Additionally, there are infinite decreasing sequences of sets under this relation.
Finally, Turing reductions connect to much broader mathematical systems. They help us understand the limits of what can be calculated. For example, every set is reducible to its own Turing jump. However, the Turing jump of a set is never reducible back to the original set. This shows a clear hierarchy of difficulty. We also see these ideas in set theory through the notion of relative constructibility. Even weaker reductions exist, such as when a set is defined by a formula of Peano arithmetic. These layers of complexity help mathematicians map the entire landscape of what is possible to know through computation.
Where will your curiosity go next?
More to explore
✨ What else?
Related topics you might enjoy
🔬 Go deeper
More advanced topics to explore
🪜 Step back
Simpler topics to build understanding
What is Nepedia?
A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.