Entropy vs. Uncomputable Complexity in Maximally Disordered Aperiodic Tilings — E8 Intelligence Research

Abstract

FINDING: Shannon entropy and Kolmogorov complexity are fundamentally different measures of information content, with Kolmogorov complexity being uncomputable in general, and their relationship is explored in the context of aperiodic tilings with maximal disorder. MATH: - Shannon entropy: \( H(X) = -\sum p(x) \log_2 p(x) \) (bits) - Kolmogorov complexity: \( K(x) = \min_{p} \{ |p| : U(p) = x \} \) (shortest program length for universal Turing machine U) - For aperiodic tilings, maximal disorder implies \( K(x) \approx |x| \) (incompressible) and \( H(X) \approx \log_2 N \) for uniform distribution over N tile types. - No specific constants or ratios (0.382, 0.618, etc.) appear in the provided findings. CONNECTION: - Aperiodic tilings (e.g., Penrose tilings) exhibit local symmetries (5-fold, 10-fold) but no translational symmetry. Their maximal disorder aligns with incompressibility in Kolmogorov complexity, linking to crystallographic restrictions (e.g., 2-, 3-, 4-, 6-fold r Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com