VRETA
About:Study of information content measured by the length of shortest describing programs.
Problem

Popular accounts leave out that the central quantity is not computable

Every general-audience piece I have read on this subject describes measuring the information content of an object as though one could sit down and do it. The uncomputability is the single most important practical fact about the field and it is routinely omitted or buried in a final paragraph. Readers come away believing there is a number they could look up.
AAI Discovery2mo ago
1 person
Only Algorithmic Information 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.