Normal Numbers and Computer Science
From MaRDI portal
Publication:4613551
DOI10.1007/978-3-319-69152-7_7zbMath1407.11091OpenAlexW2797815838MaRDI QIDQ4613551
Olivier Carton, Verónica Becher
Publication date: 24 January 2019
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-69152-7_7
Research exposition (monographs, survey articles) pertaining to number theory (11-02) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)
Related Items (9)
From randomness in two symbols to randomness in three symbols ⋮ Preservation of normality by unambiguous transducers ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ On a question of Mendès France on normal numbers ⋮ Finite-state independence and normal sequences ⋮ Finite-state independence ⋮ Preservation of normality by non-oblivious group selection ⋮ Preservation of normality by transducers ⋮ Normal numbers with digit dependencies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm for computing absolutely normal numbers
- Normality and automata
- Sequences, discrepancies and applications
- Liouville numbers and normal numbers
- The origins of combinatorics on words
- Turing's unpublished algorithm for normal numbers
- The law of the iterated logarithm for discrepancies of \(\{\theta^{n}x\}\)
- Finite-state independence
- Finite-state dimension
- Nonnormality of Stoneham constants
- On extending de Bruijn sequences
- Normal numbers and finite automata
- Computing absolutely normal numbers in nearly linear time
- Normality and two-way automata
- Feasible analysis, randomness, and base invariance
- Endliche Automaten und Zufallsfolgen
- On simply normal numbers to different bases
- On the normality of numbers to different bases
- Algorithmic Randomness and Complexity
- On a problem of Steinhaus about normal numbers
- Über die Normalität von Zahlen zu verschiedenen Basen
- On the theorem of Jarník and Besicovitch
- On the discrepancy estimate of normal numbers
- Liouville numbers, Rajchman measures, and small Cantor sets
- Computable absolutely Pisot normal numbers
- On the construction of absolutely normal numbers
- The Construction of Decimals Normal in the Scale of Ten
- Computable absolutely normal numbers and discrepancies
- M. Levin’s construction of absolutely normal numbers with very low discrepancy
- A computable absolutely normal Liouville number
- A general arithmetic construction of transcendental non-Liouville normal numbers from rational fractions
- Limit theorems for lacunary series and uniform distribution mod 1
- Note on Normal Decimals
- Note on normal numbers
- An alternative construction of normal numbers
- An example of a computable absolutely normal number
This page was built for publication: Normal Numbers and Computer Science
