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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The Bernoulli Factory problem and some connections with Computable Analysis

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Department of Geography Zoom meeting ID 837 8058 8985. Passcode 428653 Bristol-Meyers Squibb lecture theatre, Chemistry Department, Lensfield Road

Other talks

Discovery Investigations: Science, Empire and the Making of the British South Atlantic Title to be confirmed Talk title TBC Tea and Coffee Break Using numerical simulations for solving spectral geometry problems Talk title TBC
 

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