Turing's unpublished algorithm for normal numbers
From MaRDI portal
Publication:884468
DOI10.1016/j.tcs.2007.02.022zbMath1117.03051WikidataQ61927032 ScholiaQ61927032MaRDI QIDQ884468
Verónica Becher, Santiago Figueira, Rafael Picchi
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.022
11Y16: Number-theoretic algorithms; complexity
11-03: History of number theory
03-03: History of mathematical logic and foundations
11K16: Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc.
03D80: Applications of computability and recursion theory
Cites Work
- Resource bounded randomness and weakly complete problems
- Asymptotic distribution $\mathrm{mod} m$ and independence of sequences of integers, I
- Random Generators and Normal Numbers
- Note on normal numbers
- An example of a computable absolutely normal number
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item