Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the von Neumann Extractor, aiming to provide and analyze an asymptotically optimal extractor for binary strings. It explains the extraction procedure, proving uniformity, rate computation, and the recursion relation for the extraction rates. The lecture concludes with Propositions regarding the convergence of the extraction rates and the fixed point of the extraction operator.