Turing's normal numbers: towards randomness

DOI10.1007/978-3-642-30870-3_5MaRDI QIDQ2904391zbMATH OpenOpenAlexWikidataFDO

Authors Verónica Becher

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_5

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of mathematical logic and foundations (03-03) Applications of computability and recursion theory (03D80) History of number theory (11-03) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Number-theoretic algorithms; complexity (11Y16) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Turing's unpublished algorithm for normal numbers
• Normal numbers and computer science
• scientific article; zbMATH DE number 1665444
• Computable absolutely normal numbers and discrepancies
• Normal numbers and pseudorandom generators

Cited in

(5)

• Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
• Experimental analysis on the normality of , e, , 2 using advanced data-mining techniques
• Randomness, computation and mathematics
• Normal numbers and computer science
• Turing's unpublished algorithm for normal numbers

This page was built for publication: Turing's normal numbers: towards randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904391)