Computer Science – Information Theory
Scientific paper
2011-02-26
Computer Science
Information Theory
Invited talk prepared for CSR 2011
Scientific paper
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity are compared with their counterparts not involving complexity.
No associations
LandOfFree
Kolmogorov complexity as a language does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Kolmogorov complexity as a language, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kolmogorov complexity as a language will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-303087