Re:Information Theory with TensorFlow
by Footpost on Sunday December 15, 2019 @09:05AM
(#21796268)
The great G.-C. Rota quipped:
In this vein let me add:
[ Parent
| on HN ]
The significant thing is not that we're arbitrarily applying the log function to probabilities. It is that there's a relationship between expected code length and the entropy of a source. It is surprising, to me at least, that the length of a thing is related to its probability. From that relationship come a number of fascinating connections to many other fields. Check out Cover and Thomas' "Elements of Information Theory" for a very approachable introduction to all these connections.
Isn't that exactly what Occam's Razor teaches us?
"Entities should not be multiplied without necessity."