Pages that link to "Item:Q386000"
From MaRDI portal
The following pages link to A polynomial-time algorithm for computing absolutely normal numbers (Q386000):
Displaying 20 items.
- Derandomization in game-theoretic probability (Q468727) (← links)
- A note on the points with dense orbit under the expansions of different bases (Q502050) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- Liouville, computable, Borel normal and Martin-Löf random numbers (Q1787950) (← links)
- Computing absolutely normal numbers in nearly linear time (Q2051782) (← links)
- Unexpected distribution phenomenon resulting from Cantor series expansions (Q2344273) (← links)
- Normality in non-integer bases and polynomial time randomness (Q2353390) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- Normality of different orders for Cantor series expansions (Q4588502) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- Algorithmic Fractal Dimensions in Geometric Measure Theory (Q5024574) (← links)
- On a question of Mendès France on normal numbers (Q5084403) (← links)
- Quadratic-Time Algorithms for Normal Elements (Q5121105) (← links)
- Computable absolutely normal numbers and discrepancies (Q5270839) (← links)
- M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
- Dynamical Systems and Uniform Distribution of Sequences (Q5275972) (← links)
- A computable absolutely normal Liouville number (Q5501153) (← links)
- An example of a computable absolutely normal number (Q5958342) (← links)
- On sequential structures in incompressible multidimensional networks (Q6656782) (← links)
