We develop two complementary generative mechanisms that explain when and why Benford's first-digit law arises. First, a probabilistic Turing machine (PTM) ensemble induces a geometric law for codelength. Maximizing its entropy under a constraint on halting length yields Benford statistics. This model shows a phase transition with respect to the halt probability. Second, a constrained partition model (Einstein-solid combinatorics) recovers the same logarithmic profile as the maximum-entropy solution under a coarse-grained entropy-rate constraint, clarifying the role of non-ergodicity (ensemble vs. trajectory averages). We also perform numerical experiments that corroborate our conclusions.

翻译：我们提出了两种互补的生成机制，用于解释本福特定律在何种条件下出现及其成因。首先，概率图灵机（PTM）系综为编码长度导出几何分布规律。在停机长度约束下最大化其熵，即可得到本福特统计特性。该模型展示了关于停机概率的相变现象。其次，受约束的分割模型（爱因斯坦固体组合学）在粗粒度熵率约束下，通过最大熵解重现了对数分布特征，从而阐明了非遍历性（系综平均与轨迹平均的区别）的作用。我们还进行了数值实验以验证所得结论。