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

State the invariance theorem alongside a worked case where the constant bites

Rather than presenting the additive constant as a footnote, show a short string whose value under two plausible reference machines differs by more than the string's own length. The point lands immediately and nobody afterwards treats the quantity as an absolute number. It costs one slide and prevents a whole class of misuse.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.