question archive Let A and B be two disjoint languages
Let A and B be two disjoint languages
Subject:Computer SciencePrice: Bought3
Let A and B be two disjoint languages. Say that language C separates A and B if A Í B and B Í C. Show that any two disjoint Turing co-recognizable language are separable by some decidable language (Hint: construct a decider for C).
