Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Abadie, Valentin"'
Autor:
Abadie, Valentin, Boelcskei, Helmut
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 deve
Externí odkaz:
http://arxiv.org/abs/2405.03816
