Google Answers: Lower bound of Kolmogorov complexity in concatenation

View Question

Q: Lower bound of Kolmogorov complexity in concatenation ( No Answer, 0 Comments )

Question

Subject: Lower bound of Kolmogorov complexity in concatenation
Category: Computers > Algorithms
Asked by: nr9-ga
List Price: $50.01

Posted: 02 Aug 2004 13:19 PDT
Expires: 03 Aug 2004 12:17 PDT
Question ID: 382560

How do ou show that for any c, some strings x and y exist, where K(xy) > K(x) + K(y) + c? K(x) is Kolmogorov complexity.
Clarification of Question by nr9-ga on 02 Aug 2004 21:22 PDT sorry the subject should be upper bound

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