BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Chris Porter (Drake University)
DTSTART:20200514T180000Z
DTEND:20200514T190000Z
DTSTAMP:20260423T035610Z
UID:OLS/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/4/">Rand
 omness extraction from a computability-theoretic perspective</a>\nby Chris
  Porter (Drake University) as part of Online logic seminar\n\n\nAbstract\n
 The goal of this talk is to discuss recent work\, joint with Doug Cenzer\,
  on a notion of the extraction rate of Turing functionals that translate b
 etween notions of randomness with respect to different underlying probabil
 ity measures.  We will analyze several classes of extraction procedures:  
 a first that generalizes von Neumann's trick for extracting unbiased rando
 mness from the tosses of a biased coin\, a second based on work of generat
 ing biased randomness from unbiased randomness by Knuth and Yao\, and a th
 ird independently developed by Levin and Kautz that generalizes the data c
 ompression technique of arithmetic coding.  For each of the above classes 
 of extraction procedures\, we will identify a level of algorithmic randomn
 ess for an input that guarantees that we attain the corresponding extracti
 on rate in producing an output.  I will aim to present this material in a 
 way that is accessible to logicians who are not specialists in computabili
 ty theory / algorithmic randomness.\n
LOCATION:https://researchseminars.org/talk/OLS/4/
END:VEVENT
END:VCALENDAR