Pages that link to "Item:Q884468"
From MaRDI portal
The following pages link to Turing's unpublished algorithm for normal numbers (Q884468):
Displaying 14 items.
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- On the expansions of a real number to several integer bases (Q1759752) (← links)
- Nonnormality of Stoneham constants (Q1927649) (← links)
- Computing absolutely normal numbers in nearly linear time (Q2051782) (← links)
- Unexpected distribution phenomenon resulting from Cantor series expansions (Q2344273) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Finite-state independence and normal sequences (Q2424666) (← links)
- An experimental investigation of the normality of irrational algebraic numbers (Q2840634) (← links)
- (Q3305194) (← links)
- Normality of different orders for Cantor series expansions (Q4588502) (← links)
- Normal Numbers and Computer Science (Q4613551) (← links)
- Computable absolutely normal numbers and discrepancies (Q5270839) (← links)
- M. Levin’s construction of absolutely normal numbers with very low discrepancy (Q5270840) (← links)
- Normal number constructions for Cantor series with slowly growing bases (Q5739706) (← links)
