A computable absolutely normal Liouville number
From MaRDI portal
Publication:5501153
Recommendations
- Computing absolutely normal numbers in nearly linear time
- A polynomial-time algorithm for computing absolutely normal numbers
- Liouville, computable, Borel normal and Martin-Löf random numbers
- Computable absolutely Pisot normal numbers
- M. Levin's construction of absolutely normal numbers with very low discrepancy
Cites work
- A polynomial-time algorithm for computing absolutely normal numbers
- Distribution modulo one and Diophantine approximation
- Liouville numbers and normal numbers
- Liouville numbers, Rajchman measures, and small Cantor sets
- Normality and finite-state dimension of Liouville numbers
- On Weyl's criterion for uniform distribution
- On a theorem of Kaufman: Cantor-type construction of linear fractal Salem sets
- On the normality of numbers to different bases
Cited in
(13)- Finite state incompressible infinite sequences
- Liouville numbers and the computational complexity of changing bases
- Computable absolutely Pisot normal numbers
- Liouville, computable, Borel normal and Martin-Löf random numbers
- Normality and finite-state dimension of Liouville numbers
- An example of a computable absolutely normal number
- A simple construction of absolutely disjunctive Liouville numbers
- M. Levin's construction of absolutely normal numbers with very low discrepancy
- Normal numbers and computer science
- Computing absolutely normal numbers in nearly linear time
- On sequential structures in incompressible multidimensional networks
- A polynomial-time algorithm for computing absolutely normal numbers
- Computable absolutely normal numbers and discrepancies
This page was built for publication: A computable absolutely normal Liouville number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501153)
