Normality and finite-state dimension of Liouville numbers
From MaRDI portal
Publication:285510
DOI10.1007/s00224-014-9554-8zbMath1345.68183arXiv1204.4104OpenAlexW2024776286WikidataQ114230789 ScholiaQ114230789MaRDI QIDQ285510
Satyadev Nandakumar, Santhosh Kumar Vangapelli
Publication date: 19 May 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4104
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items
Liouville, computable, Borel normal and Martin-Löf random numbers, A computable absolutely normal Liouville number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Liouville numbers and normal numbers
- Entropy rates and finite-state dimension
- General constructions of normal numbers of Korobov type
- The Kolmogorov complexity of real numbers.
- Finite-state dimension
- Endliche Automaten und Zufallsfolgen
- Compression of individual sequences via variable-rate coding
- The Construction of Decimals Normal in the Scale of Ten
- A computable absolutely normal Liouville number
- Normal Recurring Decimals