BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Learning and randomness - Tomasz Steifer (Pontificia Universidad C
 atólica de Chile\, Polish Academy of Sciences)
DTSTART:20220610T123000Z
DTEND:20220610T133000Z
UID:TALK174848@talks.cam.ac.uk
DESCRIPTION:Recently\, a connection has been established between two branc
 hes of the computability theory\, namely between algorithmic randomness an
 d algorithmic learning theories. Learning-theoretical characterizations of
  several notions of randomness were discovered. &nbsp\;We study such chara
 cterizations based on the asymptotic density of positive answers. Then we 
 discuss the close relation between learning and convergence of computable 
 functions on algorithmically random points.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR