2018/05/14 by T. E. Raptis, Theophanes E. Raptis, Raptis, Theophanes E.
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Computability, Logic, AI Algorithms #FOS: Physical sciences #General Physics (physics.gen-ph) #Mathematical Dynamics and Fractals #physics.gen-ph
paper · pdf · doi:10.48550/arxiv.1805.06301
11 p., 2 figures
arxiv created 2018/05/14 · openalex publication_date 2018/05/14 · arxiv updated 2018/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a decomposition of binary entropies in a pair of fractal sequences as functional composites of binary digit-sum functions and we construct a unique formula and an abstract partition function for these. We also prove, based on a previously introduced tool of the inductive combinatorial hierarchies that the naturally inherited self-similarity of the resulting hierarchy of entropic sets contains equivalence classes providing unlimited symbolic series for satisfying the demand posed by the FIN conjecture.