0 votes 0 votes Give an example of an undecidable language $B$, where $B \leq_{m} \overline{B}$. Theory of Computation michael-sipser theory-of-computation turing-machine decidability reduction proof + – admin asked Oct 19, 2019 admin 292 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.