OpenAI's proof that BPL=L

Name: OpenAI's proof that BPL=L
Uploaded: 2026-10-27T05:35:26Z
Duration: 1 h 10 s
Channel: Simons Institute for the Theory of Computing
Description: William Hoza presents a talk on derandomization and the proof that BPL equals L.

Simons Institute for the Theory of Computing

77K subscribers • 30 videos on Hallway • University channel

YouTube

One of the most-watched uploads on Simons Institute, a conference or university channel Hallway lists. Nobody has recommended it in the communities yet, so it ranks below community picks.
Presented by William Hoza, The University of Chicago

Advanced. Deep dive for people who know the field.

24K views6 days ago

Computer science Computation and complexity Algorithms

William Hoza presents a talk on derandomization and the proof that BPL equals L.

William Hoza (The University of Chicago) simons.berkeley.edu/talks/william-hoza-university-chicago-20… Derandomization

Why it's here

A top upload from a listed channel

Simons Institute is on Hallway's list of conference and university channels, and this upload is one of its most-watched talks or lectures. Nobody has recommended it in the communities yet, so it ranks below community picks.