A polynomial-time algorithm for computing absolutely normal numbers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 52515 (Why is no real title available?)
- An example of a computable absolutely normal number
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Distribution modulo one and Diophantine approximation
- Turing's unpublished algorithm for normal numbers
- Über die Normalität von Zahlen zu verschiedenen Basen
Cited in
(21)- Normality in non-integer bases and polynomial time randomness
- Turing's unpublished algorithm for normal numbers
- Computable absolutely Pisot normal numbers
- Quadratic-Time Algorithms for Normal Elements
- Liouville, computable, Borel normal and Martin-Löf random numbers
- A computable absolutely normal Liouville number
- An example of a computable absolutely normal number
- Algorithmic Fractal Dimensions in Geometric Measure Theory
- Unexpected distribution phenomenon resulting from Cantor series expansions
- Derandomization in game-theoretic probability
- 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
- Dynamical systems and uniform distribution of sequences
- Feasible analysis, randomness, and base invariance
- Finite-state independence and normal sequences
- On sequential structures in incompressible multidimensional networks
- A note on the points with dense orbit under the expansions of different bases
- Normality of different orders for Cantor series expansions
- On a question of Mendès France on normal numbers
- Computable absolutely normal numbers and discrepancies
This page was built for publication: A polynomial-time algorithm for computing absolutely normal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386000)
