Let A and B be two disjoint languages. Say that language C
Chapter , Problem 4.20(choose chapter or problem)
Let A and B be two disjoint languages. Say that language C separates A and B if A C and B C. Show that any two disjoint co-Turing-recognizable languages are separable by some decidable language.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer