Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.
Are you here to participate in a specific proposal? Click on the proposal tag (with the dark outline) to see only posts about that proposal and not all of the others that are in progress. Tags are at the bottom of each post.
Comments on Can you summarize any explanation?
Parent
Can you summarize any explanation? Question
When explaining a piece of knowledge, sometimes the explanation is short and simple and other times it is long and complex.
Some people put the burden on the explainer, and demand that they make it shorter or more detailed, which implies the explainer chooses how long the explanation is to be.
On the other hand, explainers can object that the explanation cannot be made any simpler or any more in depth. Of course, it could be that the topic is complex and the explainer simply has limited knowledge, so claiming inability to make an explanation longer and more complex is a moot matter. My interest is in simplifying. It seems like if you are able to produce a complex explanation, there should be nothing stopping you from a producing a simpler one.
I am aware of concepts like Kolmogorov complexity, which obviously put a floor on the simplification of complex things. However, these refer to lossless simplification. I assume that a summary, by its nature, is lossy - the purpose of it is to provide a superficial description, and leave breadcrumbs which the audience can research if they are interested in learning more.
Obviously you can always produce a summary that loses more or less information. However, are there cases where the information loss is catastrophic? Is there ever a case where summarizing a topic into something with half the length will leave you with vastly less than half the information content? Or does the information content scale linearly with length, regardless of topic?
Post
Consider Shamir's secret sharing. The idea is you need $k$ out of $n$ parts of a key to recover some secret $S$. Then, if you "summarize" a key and encrypted text without providing at least $k$ parts of the key, you effectively lose all of the information in the encrypted text.
But this example is quite convoluted and I'm not quite sure if it's what you're looking for.
1 comment thread
0 comment threads