We establish a relationship between the algorithmic (Kolmogorov) complexity of the prefixes of any binary expansion and a specific $\beta$-expansion, for every computable $\beta \in (1,2)$. The proof of the main statement crucially hinges on the development of a new dynamical system that generates this specific $\beta$-expansion. This dynamical system can be implemented on a computer.
翻译:暂无翻译