Normal numbers and perfect necklaces
Verónica Becher (Universidad de Buenos Aires)
Abstract: The most famous example of a normal number is Champernowne's constant 0.123456789101112… Although the definition is very simple, the original proof of normality requires quite some work. In this talk I present "perfect necklaces", a combinatorial object that yields a simple proof of Champernowne's normality result. And with a class of them, the "nested perfect necklaces", I explain M. Levin's constant, the number with the fastest known speed of convergence to normality.
logic
Audience: researchers in the topic
Computability theory and applications
Series comments: Description: Computability theory, logic
The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.
Organizers: | Damir Dzhafarov*, Vasco Brattka*, Ekaterina Fokina*, Ludovic Patey*, Takayuki Kihara, Noam Greenberg, Arno Pauly, Linda Brown Westrick |
*contact for this listing |