Some language A  is called complementary if A m complement of A. How can I show that there exists anundecidable complementary language?
Prove that there exists an undecidable complementary language
computability;turing machines