 It is common, as shown here, to use boldface notation to denote degrees.The most fundamental reducibility notion is Turing reducibility.A set "A" of natural numbers is Turing reducible to a set "B" if and only if there is an oracle Turing machine that, when run with "B" as its oracle set, will compute the indicator function (characteristic function) of "A".