Turing’s Normal Numbers: Towards Randomness

DOI10.1007/978-3-642-30870-3_5zbMath1357.03077OpenAlexW127118003WikidataQ61927023 ScholiaQ61927023MaRDI QIDQ2904391

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) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Number-theoretic algorithms; complexity (11Y16) History of number theory (11-03) History of mathematical logic and foundations (03-03) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Applications of computability and recursion theory (03D80)

Related Items (3)

Randomness, Computation and Mathematics ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Experimental Analysis on the Normality of Using Advanced Data-Mining Techniques (Experimental Analysis on the Normality of pi, e, phi, and square root of 2 Using Advanced Data-Mining Techniques)

This page was built for publication: Turing’s Normal Numbers: Towards Randomness