3 ms·
entropy of a bit string may be another way to view the bitwise derivative. paper here for analyzing primes: https://arxiv.org/abs/1305.0954 [BiEntropy
by johnthescott 2y ago
entropy of a bit string may be another way to view the bitwise derivative. paper here for analyzing primes:
https://arxiv.org/abs/1305.0954
[BiEntropy - The Approximate Entropy of a Finite Binary String]
- nico 2y agoThank you for the reference, these concepts are definitely closely related This is super interesting: > We successfully test the algorithm in the fields of Prime Number Theory (where we prove explicitly that the sequence of prime numbers is not periodic) What we do, and what ML algorithms try to imitate, when learning, is exactly that: finding loops (periodic sequences) within the data (or rather, fitting the data to continuous “loopy” representations)