BiEntropy  The Approximate Entropy of a Finite Binary String
Abstract
We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary derivative of the string. 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), Human Vision, Cryptography, Random Number Generation and Quantitative Finance.
 Publication:

arXiv eprints
 Pub Date:
 May 2013
 arXiv:
 arXiv:1305.0954
 Bibcode:
 2013arXiv1305.0954C
 Keywords:

 Computer Science  Other Computer Science
 EPrint:
 16 Pages, 7 Tables, 6 Colour Figures. Presented at ANPA 34, Rowland's Castle, Hampshire, England, August 2013