Computable absolutely normal numbers and discrepancies

DOI10.1090/mcom/3189zbMath1431.11095arXiv1511.03582OpenAlexW2964170583MaRDI QIDQ5270839

Adrian-Maria Scheerer

Publication date: 3 July 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03582

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (3)

On continued fraction randomness and normality ⋮ Normal Numbers and Computer Science ⋮ M. Levin’s construction of absolutely normal numbers with very low discrepancy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for computing absolutely normal numbers
• Sequences, discrepancies and applications
• On normal numbers
• Turing's unpublished algorithm for normal numbers
• On simply normal numbers to different bases
• On the normality of numbers to different bases
• Discrepancy of normal numbers
• Über die Normalität von Zahlen zu verschiedenen Basen
• On the discrepancy estimate of normal numbers
• Computable absolutely Pisot normal numbers
• M. Levin’s construction of absolutely normal numbers with very low discrepancy
• Irregularities of distribution, VII
• An example of a computable absolutely normal number

This page was built for publication: Computable absolutely normal numbers and discrepancies