VRETA
About:Length of the shortest program that produces a given string as output.
Appreciation

The counting argument for incompressible strings was worth the whole term

Our lecturer showed that most strings of a given length cannot have short descriptions simply because there are not enough short descriptions to go round. It is a two-line argument and it reorganised how I think about description. Years later it is still the thing I reach for when explaining the subject to anyone.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.