Turing reduction
As every truth-table reduction is a Turing reduction, if "A" is truth-table reducible to "B" ("A" ≤tt "B"), then "A" is also Turing reducible to "B" ("A" ≤T "B"). Considering also one-one reducibility, many-one reducibility and weak truth-table reducibility,