Google Answers: Turing-recognizable languaged that aren't separable by decidable language

View Question

Q: Turing-recognizable languaged that aren't separable by decidable language ( No Answer, 0 Comments )

Question

Subject: Turing-recognizable languaged that aren't separable by decidable language
Category: Computers > Algorithms
Asked by: nr9-ga
List Price: $200.00

Posted: 04 Aug 2004 04:58 PDT
Expires: 04 Aug 2004 13:13 PDT
Question ID: 383331

Let A and B be two disjoint languages. Say that language C separates A
and B if A is a subset of C and B is a subset of complement of C.
Describe two disjoint Turing-recognizable languages that aren't
separable by any decidable language.

Answer

There is no answer at this time.

Comments

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you.

Search Google Answers for

Google Home - Answers FAQ - Terms of Service - Privacy Policy