0 votes 0 votes Let $A$ and $B$ be two disjoint languages. Say that language $C$ separates $A$ and $B$ if $A \subseteq C$ and $B \subseteq \overline{C}$. Show that any two disjoint co-Turing-recognizable languages are separable by some decidable language. Theory of Computation michael-sipser theory-of-computation recursive-and-recursively-enumerable-languages proof + – admin asked Oct 17, 2019 admin 296 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.