Live briefing
Everything about Turing reduction
Concept in computability theory
In computability theory, a Turing reduction from a decision problem to a decision problem is an oracle machine that decides problem given an oracle for in finitely many steps. It can be understood as an algorithm that could be used to solve if it had access to a subroutine for solving. The concept can be analogously applied to function problems. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Turing reductionA 5-minute orientation
- Skim a recent paper: Potential-Driven Restructuring of Cu Single Atoms to Nanoparticles for Boosting the Electrochemical Reduction of Nitrate to AmmoniaInfluential work since 2022
- Pick up a classic book: An introduction to formal languages and automataThe most-reprinted book on the subject
- Read the landmark paper: Model reduction enables Turing instability analysis of large reaction–diffusion modelsCited 22 times
- Go sideways: Computability theoryA closely related topic
- Go sideways: Reduction (computability theory)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Model reduction enables Turing instability analysis of large reaction–diffusion models
The reduction of tape reversals for off-line one-tape Turing machines
The logic of interactive turing reduction
Strong nondeterministic turing reduction—A technique for proving intractability
Model-reduction techniques for PDE models with Turing type electrochemical phase formation dynamics
Computable fields and the bounded Turing reduction
An Approach to Efficient Reduction of Ethereum's Turing‐Completeness
🆕 Influential since 2022
📚 Books worth reading
An introduction to formal languages and automataPeter Linz · 1990
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Snow mountain passageJames D. Houston · 2001
Introduction to the theory of computationMichael Sipser · 1996- 📕Sociologie du numériqueDominique Boullier · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Reduction (computability theory) In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Truth-table reduction In computability theory, a truth-table reduction is a type of reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle…
- Enumeration reducibility In computability theory, enumeration reducibility (or e-reducibility for short) is a specific type of reducibility. Roughly speaking, A is enumeration-reducible…
- Many-one reduction In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances…
- Computability Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic…
- Reduction (complexity) In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently…