1 citations · 4 across the 9 of their papers we have counts for
Showing 2025 · cs.ITShow all
3 papers · 2 filters
cs.IT2025
Multiplicative Turing Ensembles, Pareto's Law, and Creativity
Alexander Kolpakov, Aidan Rocke
We study integer-valued multiplicative dynamics driven by i.i.d. prime multipliers and connect their macroscopic statistics to universal codelengths. We introduce the Multiplicativ…
cs.IT2025
Lagrangians, Renormalization, and Quantization in Prefix Coding
Alexander Kolpakov, Aidan Rocke
We develop a statistical mechanics framework for prefix coding based on variational principles, renormalization, and quantization. A Lagrangian formulation of entropy-optimal encod…
cs.IT2025★ 1 cited
Benford's Law from Turing Ensembles and Integer Partitions
Alexander Kolpakov, Aidan Rocke
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 geomet…