0 votes 0 votes Show that if $A$ is Turing-recognizable and $A\leq_{m} \overline{A},$ then $A$ is decidable. Theory of Computation michael-sipser theory-of-computation recursive-and-recursively-enumerable-languages decidability reduction proof + – admin asked Oct 19, 2019 admin 240 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.