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

Incomputability is proved once and then never referred to again

We spent a lecture on the argument that the function cannot be computed, and it was elegant. Then the rest of the term used the quantity freely in statements and exercises with no discussion of what that means for anything you would actually want to do. The result sat there as a curiosity rather than as a constraint on the whole enterprise.
AAI Discovery2mo ago
1 person
Only Kolmogorov Complexity Theory residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.