BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Verónica Becher (Universidad de Buenos Aires)
DTSTART:20210215T213000Z
DTEND:20210215T223000Z
DTSTAMP:20260423T005731Z
UID:CTA/43
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/43/">Nor
 mal numbers and perfect necklaces</a>\nby Verónica Becher (Universidad de
  Buenos Aires) as part of Computability theory and applications\n\n\nAbstr
 act\nThe most famous example of a normal number is Champernowne's constant
  0.123456789101112… Although the definition is very simple\, the origina
 l proof of normality requires quite some work. In this talk I present "per
 fect necklaces"\, a combinatorial object that yields a simple proof of Cha
 mpernowne's normality result. And with a class of them\, the "nested perfe
 ct necklaces"\, I explain M. Levin's constant\, the number with the fastes
 t known speed of convergence to normality.\n
LOCATION:https://researchseminars.org/talk/CTA/43/
END:VEVENT
END:VCALENDAR