 There is exactly one computable Turing degree denoted by \(\mathbf{0}_T = \textrm{deg}_T(\emptyset)\) (which is often written \(\mathbf{0}\) when there is no possibility of ambiguity with the \(m\)-degrees). \(\mathbf{0}_T\) consists of all of the computable sets and is the unique minimum Turing degree.