Skip to search formSkip to main contentSkip to account menu

Truth-table reduction

Known as: Tt-reduction, Bounded Turing reduction, Weak truth table reduction 
In computability theory, a truth-table reduction is a reduction from one set of natural numbers to another. As a "tool", it is weaker than Turing… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations

Broader (2)

Computability theoryComputational complexity theory
Computable functionHypercomputationPolynomial-time reductionReduction (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Children's Facial Expressions in Truthful and Deceptive Interactions with a Virtual Agent
The present study focused on the facial expressions that children exhibit while they try to deceive a virtual agent. An… 
2014
2014
Experimental study on the copper slag reduction process
This paper studies the carbon reduction and magnetic separation of copper slag's flotation tailings.The impact of the roasting… 
2013
2013
High-Performance InAs-On-Insulator n-MOSFETs With Ni-InGaAs S/D Realized by Contact Resistance Reduction Technology
We have systematically analyzed the components of source/drain (S/D) resistance (RSD) in InGaAs n-MOSFETs with Ni-InGaAs metal S… 
Review
2013
Review
2013
NAIVE TRUTH AND RESTRICTED QUANTIFICATION: SAVING TRUTH A WHOLE LOT BETTER
Abstract Restricted quantification poses a serious and under-appreciated challenge for nonclassical approaches to both vagueness… 
2013
2013
Schematizing Proofs Based on Flow of Truth Values in Logic
The sentential (formal) representation of logic formulas has been described as "unreadable," and this contributes to its… 
2008
2008
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques
A static dependency pair method, proposed by us, can effectively prove termination of simply-typed term rewriting systems (STRSs… 
2004
2004
New foundations for epistemic change*
It is no news that there is a debate in epistemology between foundationalists and coherentists. What might be news is that there… 
2000
2000
Local likelihood estimation in varying-coefficient models including additive bias correction
Varying coefficient models result from generalized linear models by allowing the parameter of the linear predictor to vary across… 
1997
1997
T × W Completeness
T × W logic is a combination of tense and modal logic for worlds or histories with the same time order. It is the basis for… 
Highly Cited
1993
Highly Cited
1993
Existence Presuppositions and Background Knowledge
When a definite noun phrase fails to refer, the statement containing it is often felt to lack a truth value, as in The king of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)