HackerPapers

arXiv:1305.0954cs.OH

BiEntropy - The Approximate Entropy of a Finite Binary String

Grenville J. Croll

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
16 Pages, 7 Tables, 6 Colour Figures. Presented at ANPA 34, Rowland's Castle, Hampshire, England, August 2013
Journal reference
DOI
Subjects
cs.OHOther Computer Science

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2024 to May 2024.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. The derivative of a number (2014) 1 comment

    • 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]

      johnthescottView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.