Midwest Computability Seminar

Part ii

The Midwest Computability Seminar is meeting remotely in the winter and spring of 2021. The recurring Zoom link is:


Meeting ID: 997 5433 2165

Passcode: midwest

slides    Panopto video    YouTube video

This session will be held jointly with the Computability Theory and Applications Online Seminar.

DATE: Monday, February 15th, 2021

TIME: 3:30 - 4:30 PM Central Time

SPEAKER: Verónica Becher - University of Buenos Aires

Normal numbers and perfect necklaces

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.

Past and Future Sessions

Previous Seminars:

If you haven't been receiving the announcements and would like to be included in the list, send an email to drh@math.uchicago.edu.