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

Semicomputability from above gets skipped, so people conclude nothing can be said

The courses I have seen present the negative result and stop, leaving the impression that the quantity is completely inaccessible. The fact that you can produce a decreasing sequence of upper bounds, and that this is what any search procedure is really doing, would reframe the whole applied side. It is one paragraph and it is almost always missing.
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.