University of Cambridge > Talks.cam > Machine Learning Reading Group @ CUED > The Bernoulli Factory problem and some connections with Computable Analysis

The Bernoulli Factory problem and some connections with Computable Analysis

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Konstantina Palla.

I’ll discuss the Bernoulli factory problem, wherein, given access to i.i.d. p-coins for some unknown p, one is asked to produce i.i.d. f(p)-coins for a known function f. There are several connections with computable analysis that I’m hoping to point out.

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity