Pages that link to "Item:Q5958342"
From MaRDI portal
The following pages link to An example of a computable absolutely normal number (Q5958342):
Displayed 9 items.
- A polynomial-time algorithm for computing absolutely normal numbers (Q386000) (← links)
- Large alphabets and incompressibility (Q845735) (← links)
- Turing's unpublished algorithm for normal numbers (Q884468) (← links)
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties (Q1019738) (← links)
- On the expansions of a real number to several integer bases (Q1759752) (← links)
- Nonnormality of Stoneham constants (Q1927649) (← links)
- An experimental investigation of the normality of irrational algebraic numbers (Q2840634) (← links)
- Hartmanis-Stearns Conjecture on Real Time and Transcendence (Q2891306) (← links)
- Champernowne’s Number, Strong Normality, and the X Chromosome (Q5746431) (← links)